./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-1.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/combinations/Problem05_label49+token_ring.08.cil-1.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', 'cc9459d71a43b78b6be6f61a2c5766a75503f0e4a415faec33f88f27c796c833'] 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/combinations/Problem05_label49+token_ring.08.cil-1.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 cc9459d71a43b78b6be6f61a2c5766a75503f0e4a415faec33f88f27c796c833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:10:16,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:10:16,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:10:16,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:10:16,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:10:16,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:10:16,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:10:16,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:10:16,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:10:16,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:10:16,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:10:16,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:10:16,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:10:16,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:10:16,521 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:10:16,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:10:16,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:10:16,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:10:16,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:16,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:10:16,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:10:16,525 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 -> cc9459d71a43b78b6be6f61a2c5766a75503f0e4a415faec33f88f27c796c833 [2024-11-07 01:10:16,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:10:16,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:10:16,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:10:16,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:10:16,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:10:16,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-1.c [2024-11-07 01:10:18,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:10:18,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:10:18,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-1.c [2024-11-07 01:10:18,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7af9f5f57/40879569804544ecabd360aab219d0b5/FLAG562c4f304 [2024-11-07 01:10:19,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7af9f5f57/40879569804544ecabd360aab219d0b5 [2024-11-07 01:10:19,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:10:19,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:10:19,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:19,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:10:19,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:10:19,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:19" (1/1) ... [2024-11-07 01:10:19,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381f9bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:19, skipping insertion in model container [2024-11-07 01:10:19,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:19" (1/1) ... [2024-11-07 01:10:19,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:10:20,349 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/combinations/Problem05_label49+token_ring.08.cil-1.c[380593,380606] [2024-11-07 01:10:20,393 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/combinations/Problem05_label49+token_ring.08.cil-1.c[383339,383352] [2024-11-07 01:10:20,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:20,578 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:10:21,077 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/combinations/Problem05_label49+token_ring.08.cil-1.c[380593,380606] [2024-11-07 01:10:21,080 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/combinations/Problem05_label49+token_ring.08.cil-1.c[383339,383352] [2024-11-07 01:10:21,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:21,168 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:10:21,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21 WrapperNode [2024-11-07 01:10:21,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:21,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:21,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:10:21,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:10:21,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:21,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:21,806 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-11-07 01:10:21,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:21,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:10:21,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:10:21,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:10:21,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:21,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:21,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,110 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:10:22,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:10:22,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:10:22,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:10:22,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:10:22,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (1/1) ... [2024-11-07 01:10:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:10:22,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:10:22,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:10:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:10:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:10:22,449 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:10:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:10:22,449 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:10:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:10:22,449 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:10:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:10:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:10:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:10:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:10:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:10:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:10:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:10:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:10:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:10:22,557 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:10:22,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:10:30,381 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-11-07 01:10:30,381 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:10:30,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:10:30,422 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 01:10:30,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:30 BoogieIcfgContainer [2024-11-07 01:10:30,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:10:30,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:10:30,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:10:30,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:10:30,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:10:19" (1/3) ... [2024-11-07 01:10:30,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37986051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:30, skipping insertion in model container [2024-11-07 01:10:30,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:21" (2/3) ... [2024-11-07 01:10:30,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37986051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:30, skipping insertion in model container [2024-11-07 01:10:30,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:30" (3/3) ... [2024-11-07 01:10:30,436 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.08.cil-1.c [2024-11-07 01:10:30,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:10:30,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:10:30,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:10:30,582 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;@6b40269a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:10:30,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:10:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:10:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:30,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:30,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:30,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:30,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash -372695446, now seen corresponding path program 1 times [2024-11-07 01:10:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429673332] [2024-11-07 01:10:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429673332] [2024-11-07 01:10:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429673332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:10:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203020389] [2024-11-07 01:10:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:10:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:31,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:10:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:10:31,086 INFO L87 Difference]: Start difference. First operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:32,330 INFO L93 Difference]: Finished difference Result 5040 states and 9262 transitions. [2024-11-07 01:10:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:10:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:32,355 INFO L225 Difference]: With dead ends: 5040 [2024-11-07 01:10:32,355 INFO L226 Difference]: Without dead ends: 2505 [2024-11-07 01:10:32,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:10:32,366 INFO L432 NwaCegarLoop]: 4291 mSDtfsCounter, 747 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 16670 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:32,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 16670 Invalid, 776 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:10:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-07 01:10:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2407. [2024-11-07 01:10:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2377 states have (on average 1.831299957930164) internal successors, (4353), 2379 states have internal predecessors, (4353), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:10:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4397 transitions. [2024-11-07 01:10:32,491 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4397 transitions. Word has length 134 [2024-11-07 01:10:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 4397 transitions. [2024-11-07 01:10:32,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4397 transitions. [2024-11-07 01:10:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:32,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:32,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:32,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:10:32,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:32,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 333901160, now seen corresponding path program 1 times [2024-11-07 01:10:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100985178] [2024-11-07 01:10:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100985178] [2024-11-07 01:10:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100985178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:10:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020708418] [2024-11-07 01:10:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:32,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:10:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:10:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:10:32,994 INFO L87 Difference]: Start difference. First operand 2407 states and 4397 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:34,557 INFO L93 Difference]: Finished difference Result 3153 states and 5582 transitions. [2024-11-07 01:10:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:10:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:34,567 INFO L225 Difference]: With dead ends: 3153 [2024-11-07 01:10:34,567 INFO L226 Difference]: Without dead ends: 2883 [2024-11-07 01:10:34,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:34,569 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5067 mSDsluCounter, 12602 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 16802 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:34,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 16802 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:10:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-11-07 01:10:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2688. [2024-11-07 01:10:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2634 states have (on average 1.8048595292331056) internal successors, (4754), 2637 states have internal predecessors, (4754), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-07 01:10:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4835 transitions. [2024-11-07 01:10:34,620 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4835 transitions. Word has length 134 [2024-11-07 01:10:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:34,620 INFO L471 AbstractCegarLoop]: Abstraction has 2688 states and 4835 transitions. [2024-11-07 01:10:34,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4835 transitions. [2024-11-07 01:10:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:34,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:34,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:34,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:10:34,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:34,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1372602388, now seen corresponding path program 1 times [2024-11-07 01:10:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356818075] [2024-11-07 01:10:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:34,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356818075] [2024-11-07 01:10:34,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356818075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:34,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:34,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:34,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49454440] [2024-11-07 01:10:34,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:34,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:34,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:34,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:34,876 INFO L87 Difference]: Start difference. First operand 2688 states and 4835 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:36,946 INFO L93 Difference]: Finished difference Result 3824 states and 6638 transitions. [2024-11-07 01:10:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:36,957 INFO L225 Difference]: With dead ends: 3824 [2024-11-07 01:10:36,957 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 01:10:36,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:36,959 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5086 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5101 SdHoareTripleChecker+Valid, 21656 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:36,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5101 Valid, 21656 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:10:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 01:10:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2950. [2024-11-07 01:10:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2872 states have (on average 1.7816852367688023) internal successors, (5117), 2876 states have internal predecessors, (5117), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-07 01:10:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5234 transitions. [2024-11-07 01:10:37,049 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5234 transitions. Word has length 134 [2024-11-07 01:10:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:37,050 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 5234 transitions. [2024-11-07 01:10:37,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5234 transitions. [2024-11-07 01:10:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:37,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:37,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:10:37,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 629283882, now seen corresponding path program 1 times [2024-11-07 01:10:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174094669] [2024-11-07 01:10:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:37,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174094669] [2024-11-07 01:10:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174094669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745246519] [2024-11-07 01:10:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:37,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:37,256 INFO L87 Difference]: Start difference. First operand 2950 states and 5234 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:39,495 INFO L93 Difference]: Finished difference Result 4813 states and 8183 transitions. [2024-11-07 01:10:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:39,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:39,507 INFO L225 Difference]: With dead ends: 4813 [2024-11-07 01:10:39,507 INFO L226 Difference]: Without dead ends: 4000 [2024-11-07 01:10:39,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:39,510 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 5166 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 20993 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:39,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 20993 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:10:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2024-11-07 01:10:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3475. [2024-11-07 01:10:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3349 states have (on average 1.74499850701702) internal successors, (5844), 3355 states have internal predecessors, (5844), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-07 01:10:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 6037 transitions. [2024-11-07 01:10:39,579 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 6037 transitions. Word has length 134 [2024-11-07 01:10:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:39,580 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 6037 transitions. [2024-11-07 01:10:39,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 6037 transitions. [2024-11-07 01:10:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:39,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:39,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:39,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:10:39,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:39,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1938538452, now seen corresponding path program 1 times [2024-11-07 01:10:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:39,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020253204] [2024-11-07 01:10:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020253204] [2024-11-07 01:10:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020253204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649507060] [2024-11-07 01:10:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:39,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:39,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:39,808 INFO L87 Difference]: Start difference. First operand 3475 states and 6037 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:41,913 INFO L93 Difference]: Finished difference Result 6718 states and 11142 transitions. [2024-11-07 01:10:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:41,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:41,947 INFO L225 Difference]: With dead ends: 6718 [2024-11-07 01:10:41,951 INFO L226 Difference]: Without dead ends: 5380 [2024-11-07 01:10:41,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:41,959 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5084 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:41,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 21654 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:10:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2024-11-07 01:10:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4526. [2024-11-07 01:10:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 4304 states have (on average 1.695631970260223) internal successors, (7298), 4314 states have internal predecessors, (7298), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:10:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 7649 transitions. [2024-11-07 01:10:42,211 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 7649 transitions. Word has length 134 [2024-11-07 01:10:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:42,212 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 7649 transitions. [2024-11-07 01:10:42,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 7649 transitions. [2024-11-07 01:10:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:42,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:42,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:10:42,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1467182102, now seen corresponding path program 1 times [2024-11-07 01:10:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849580612] [2024-11-07 01:10:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:42,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:42,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849580612] [2024-11-07 01:10:42,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849580612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:42,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:42,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001926351] [2024-11-07 01:10:42,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:42,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:42,622 INFO L87 Difference]: Start difference. First operand 4526 states and 7649 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:44,808 INFO L93 Difference]: Finished difference Result 10520 states and 17064 transitions. [2024-11-07 01:10:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:44,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:44,844 INFO L225 Difference]: With dead ends: 10520 [2024-11-07 01:10:44,844 INFO L226 Difference]: Without dead ends: 8131 [2024-11-07 01:10:44,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:44,857 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5080 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:44,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 21654 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:10:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8131 states. [2024-11-07 01:10:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8131 to 6642. [2024-11-07 01:10:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6642 states, 6228 states have (on average 1.642581888246628) internal successors, (10230), 6246 states have internal predecessors, (10230), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-07 01:10:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6642 states to 6642 states and 10915 transitions. [2024-11-07 01:10:45,128 INFO L78 Accepts]: Start accepts. Automaton has 6642 states and 10915 transitions. Word has length 134 [2024-11-07 01:10:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:45,128 INFO L471 AbstractCegarLoop]: Abstraction has 6642 states and 10915 transitions. [2024-11-07 01:10:45,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6642 states and 10915 transitions. [2024-11-07 01:10:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:45,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:45,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:45,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:10:45,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 696434472, now seen corresponding path program 1 times [2024-11-07 01:10:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820874669] [2024-11-07 01:10:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820874669] [2024-11-07 01:10:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820874669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:45,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692915206] [2024-11-07 01:10:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:45,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:45,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:45,271 INFO L87 Difference]: Start difference. First operand 6642 states and 10915 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:47,779 INFO L93 Difference]: Finished difference Result 18142 states and 29000 transitions. [2024-11-07 01:10:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:47,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:47,811 INFO L225 Difference]: With dead ends: 18142 [2024-11-07 01:10:47,812 INFO L226 Difference]: Without dead ends: 13637 [2024-11-07 01:10:47,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:47,819 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5079 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5094 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:47,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5094 Valid, 21654 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:10:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2024-11-07 01:10:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 10887. [2024-11-07 01:10:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5969868173258004) internal successors, (16112), 10123 states have internal predecessors, (16112), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 01:10:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17519 transitions. [2024-11-07 01:10:48,269 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17519 transitions. Word has length 134 [2024-11-07 01:10:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:48,269 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17519 transitions. [2024-11-07 01:10:48,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17519 transitions. [2024-11-07 01:10:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:48,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:48,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:48,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:10:48,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:48,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash -342150102, now seen corresponding path program 1 times [2024-11-07 01:10:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:48,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934912436] [2024-11-07 01:10:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:48,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934912436] [2024-11-07 01:10:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934912436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:48,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:48,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762137473] [2024-11-07 01:10:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:48,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:48,597 INFO L87 Difference]: Start difference. First operand 10887 states and 17519 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:50,367 INFO L93 Difference]: Finished difference Result 22528 states and 36089 transitions. [2024-11-07 01:10:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:10:50,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:50,404 INFO L225 Difference]: With dead ends: 22528 [2024-11-07 01:10:50,404 INFO L226 Difference]: Without dead ends: 13778 [2024-11-07 01:10:50,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:50,422 INFO L432 NwaCegarLoop]: 4185 mSDtfsCounter, 4780 mSDsluCounter, 16543 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 20728 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:50,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 20728 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:10:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2024-11-07 01:10:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 10887. [2024-11-07 01:10:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5937159282386757) internal successors, (16079), 10123 states have internal predecessors, (16079), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 01:10:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17486 transitions. [2024-11-07 01:10:51,105 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17486 transitions. Word has length 134 [2024-11-07 01:10:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:51,105 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17486 transitions. [2024-11-07 01:10:51,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17486 transitions. [2024-11-07 01:10:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:51,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:51,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:10:51,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:51,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1979651816, now seen corresponding path program 1 times [2024-11-07 01:10:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43166828] [2024-11-07 01:10:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:51,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43166828] [2024-11-07 01:10:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43166828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:51,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:51,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:51,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985364312] [2024-11-07 01:10:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:51,271 INFO L87 Difference]: Start difference. First operand 10887 states and 17486 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:54,037 INFO L93 Difference]: Finished difference Result 33351 states and 52830 transitions. [2024-11-07 01:10:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:54,100 INFO L225 Difference]: With dead ends: 33351 [2024-11-07 01:10:54,100 INFO L226 Difference]: Without dead ends: 24601 [2024-11-07 01:10:54,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:54,121 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5071 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5086 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:54,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5086 Valid, 21654 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:10:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24601 states. [2024-11-07 01:10:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24601 to 19441. [2024-11-07 01:10:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19441 states, 17875 states have (on average 1.5603356643356643) internal successors, (27891), 17941 states have internal predecessors, (27891), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 454 states have return successors, (1903), 1173 states have call predecessors, (1903), 1110 states have call successors, (1903) [2024-11-07 01:10:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19441 states to 19441 states and 30904 transitions. [2024-11-07 01:10:54,884 INFO L78 Accepts]: Start accepts. Automaton has 19441 states and 30904 transitions. Word has length 134 [2024-11-07 01:10:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:54,884 INFO L471 AbstractCegarLoop]: Abstraction has 19441 states and 30904 transitions. [2024-11-07 01:10:54,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 19441 states and 30904 transitions. [2024-11-07 01:10:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:10:54,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:54,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:54,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:10:54,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash -162208662, now seen corresponding path program 1 times [2024-11-07 01:10:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062445289] [2024-11-07 01:10:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:10:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:10:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:10:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:10:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062445289] [2024-11-07 01:10:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062445289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507795288] [2024-11-07 01:10:55,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:55,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:55,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:55,043 INFO L87 Difference]: Start difference. First operand 19441 states and 30904 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:59,011 INFO L93 Difference]: Finished difference Result 71583 states and 113144 transitions. [2024-11-07 01:10:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:59,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:10:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:59,162 INFO L225 Difference]: With dead ends: 71583 [2024-11-07 01:10:59,163 INFO L226 Difference]: Without dead ends: 54279 [2024-11-07 01:10:59,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:59,204 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5400 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5424 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:59,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5424 Valid, 21644 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:10:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54279 states. [2024-11-07 01:11:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54279 to 36418. [2024-11-07 01:11:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36418 states, 33380 states have (on average 1.5421509886159377) internal successors, (51477), 33510 states have internal predecessors, (51477), 2134 states have call successors, (2134), 774 states have call predecessors, (2134), 902 states have return successors, (4449), 2261 states have call predecessors, (4449), 2134 states have call successors, (4449) [2024-11-07 01:11:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36418 states to 36418 states and 58060 transitions. [2024-11-07 01:11:01,044 INFO L78 Accepts]: Start accepts. Automaton has 36418 states and 58060 transitions. Word has length 134 [2024-11-07 01:11:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:01,045 INFO L471 AbstractCegarLoop]: Abstraction has 36418 states and 58060 transitions. [2024-11-07 01:11:01,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36418 states and 58060 transitions. [2024-11-07 01:11:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:11:01,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:01,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:11:01,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:11:01,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash -785490264, now seen corresponding path program 1 times [2024-11-07 01:11:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696137387] [2024-11-07 01:11:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:11:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:11:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:11:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:11:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:01,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696137387] [2024-11-07 01:11:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696137387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857853516] [2024-11-07 01:11:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:01,211 INFO L87 Difference]: Start difference. First operand 36418 states and 58060 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:06,811 INFO L93 Difference]: Finished difference Result 138190 states and 220638 transitions. [2024-11-07 01:11:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:11:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:11:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:07,139 INFO L225 Difference]: With dead ends: 138190 [2024-11-07 01:11:07,140 INFO L226 Difference]: Without dead ends: 103909 [2024-11-07 01:11:07,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:11:07,240 INFO L432 NwaCegarLoop]: 4236 mSDtfsCounter, 5209 mSDsluCounter, 16803 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21039 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:07,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21039 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:11:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103909 states. [2024-11-07 01:11:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103909 to 69667. [2024-11-07 01:11:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69667 states, 63749 states have (on average 1.532369135202121) internal successors, (97687), 64007 states have internal predecessors, (97687), 4118 states have call successors, (4118), 1542 states have call predecessors, (4118), 1798 states have return successors, (10935), 4373 states have call predecessors, (10935), 4118 states have call successors, (10935) [2024-11-07 01:11:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69667 states to 69667 states and 112740 transitions. [2024-11-07 01:11:11,258 INFO L78 Accepts]: Start accepts. Automaton has 69667 states and 112740 transitions. Word has length 134 [2024-11-07 01:11:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:11,259 INFO L471 AbstractCegarLoop]: Abstraction has 69667 states and 112740 transitions. [2024-11-07 01:11:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 69667 states and 112740 transitions. [2024-11-07 01:11:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:11:11,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:11,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:11:11,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:11:11,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:11,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -667048790, now seen corresponding path program 1 times [2024-11-07 01:11:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24963975] [2024-11-07 01:11:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:11:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:11:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:11:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:11:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24963975] [2024-11-07 01:11:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24963975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141386603] [2024-11-07 01:11:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:11,522 INFO L87 Difference]: Start difference. First operand 69667 states and 112740 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:20,919 INFO L93 Difference]: Finished difference Result 267117 states and 434484 transitions. [2024-11-07 01:11:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:11:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:11:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:21,963 INFO L225 Difference]: With dead ends: 267117 [2024-11-07 01:11:21,963 INFO L226 Difference]: Without dead ends: 199587 [2024-11-07 01:11:22,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:11:22,218 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5326 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5350 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:22,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5350 Valid, 21644 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:11:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199587 states. [2024-11-07 01:11:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199587 to 136676. [2024-11-07 01:11:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136676 states, 125126 states have (on average 1.5285152566213258) internal successors, (191257), 125640 states have internal predecessors, (191257), 7958 states have call successors, (7958), 3078 states have call predecessors, (7958), 3590 states have return successors, (28153), 8469 states have call predecessors, (28153), 7958 states have call successors, (28153) [2024-11-07 01:11:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136676 states to 136676 states and 227368 transitions. [2024-11-07 01:11:29,587 INFO L78 Accepts]: Start accepts. Automaton has 136676 states and 227368 transitions. Word has length 134 [2024-11-07 01:11:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:29,588 INFO L471 AbstractCegarLoop]: Abstraction has 136676 states and 227368 transitions. [2024-11-07 01:11:29,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 136676 states and 227368 transitions. [2024-11-07 01:11:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:11:29,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:29,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:11:29,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:11:29,640 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:29,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 722245224, now seen corresponding path program 1 times [2024-11-07 01:11:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:29,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889396093] [2024-11-07 01:11:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:11:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:11:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:11:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:11:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:29,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889396093] [2024-11-07 01:11:29,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889396093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:29,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:29,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294853322] [2024-11-07 01:11:29,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:29,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:29,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:29,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:29,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:29,829 INFO L87 Difference]: Start difference. First operand 136676 states and 227368 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)