./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.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.11.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', 'baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f'] 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.11.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 baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:10:32,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:10:32,271 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:32,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:10:32,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:10:32,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:10:32,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:10:32,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:10:32,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:10:32,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:10:32,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:10:32,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:10:32,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:10:32,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:10:32,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:10:32,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:10:32,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:10:32,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:10:32,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:10:32,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:10:32,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:10:32,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:10:32,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:10:32,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:10:32,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:10:32,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:32,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:10:32,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:10:32,303 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 -> baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f [2024-11-07 01:10:32,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:10:32,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:10:32,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:10:32,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:10:32,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:10:32,634 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.11.cil-1.c [2024-11-07 01:10:33,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:10:34,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:10:34,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.c [2024-11-07 01:10:34,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c828d517/b0aa4a8e8e9e46babc30477526c28f8f/FLAG2fb563255 [2024-11-07 01:10:34,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c828d517/b0aa4a8e8e9e46babc30477526c28f8f [2024-11-07 01:10:34,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:10:34,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:10:34,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:34,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:10:34,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:10:34,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:34" (1/1) ... [2024-11-07 01:10:34,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465a208b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:34, skipping insertion in model container [2024-11-07 01:10:34,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:34" (1/1) ... [2024-11-07 01:10:34,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:10:36,019 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.11.cil-1.c[380593,380606] [2024-11-07 01:10:36,052 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.11.cil-1.c[383339,383352] [2024-11-07 01:10:36,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:36,283 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:10:36,960 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.11.cil-1.c[380593,380606] [2024-11-07 01:10:36,968 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.11.cil-1.c[383339,383352] [2024-11-07 01:10:37,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:37,115 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:10:37,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:37 WrapperNode [2024-11-07 01:10:37,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:37,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:37,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:10:37,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:10:37,123 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:37" (1/1) ... [2024-11-07 01:10:37,223 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:37" (1/1) ... [2024-11-07 01:10:37,675 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13179 [2024-11-07 01:10:37,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:37,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:10:37,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:10:37,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:10:37,696 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:37" (1/1) ... [2024-11-07 01:10:37,696 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:37" (1/1) ... [2024-11-07 01:10:37,798 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:37" (1/1) ... [2024-11-07 01:10:37,975 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:37,975 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:37" (1/1) ... [2024-11-07 01:10:37,976 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:37" (1/1) ... [2024-11-07 01:10:38,102 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:37" (1/1) ... [2024-11-07 01:10:38,170 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:37" (1/1) ... [2024-11-07 01:10:38,214 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:37" (1/1) ... [2024-11-07 01:10:38,242 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:37" (1/1) ... [2024-11-07 01:10:38,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:10:38,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:10:38,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:10:38,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:10:38,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:37" (1/1) ... [2024-11-07 01:10:38,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:10:38,327 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:38,334 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:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:10:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:10:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:10:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:10:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:10:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:10:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:10:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 01:10:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 01:10:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:10:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:10:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:10:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:10:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:10:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:10:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:10:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:10:38,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:10:38,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:10:38,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:10:46,227 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2024-11-07 01:10:46,228 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:10:46,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:10:46,302 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-07 01:10:46,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:46 BoogieIcfgContainer [2024-11-07 01:10:46,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:10:46,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:10:46,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:10:46,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:10:46,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:10:34" (1/3) ... [2024-11-07 01:10:46,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5463b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:46, skipping insertion in model container [2024-11-07 01:10:46,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:37" (2/3) ... [2024-11-07 01:10:46,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5463b5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:46, skipping insertion in model container [2024-11-07 01:10:46,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:46" (3/3) ... [2024-11-07 01:10:46,314 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.11.cil-1.c [2024-11-07 01:10:46,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:10:46,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:10:46,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:10:46,455 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;@4232c421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:10:46,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:10:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 2560 states, 2523 states have (on average 1.840665873959572) internal successors, (4644), 2528 states have internal predecessors, (4644), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:10:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:10:46,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:46,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:46,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1643265123, now seen corresponding path program 1 times [2024-11-07 01:10:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599977295] [2024-11-07 01:10:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:10:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:10:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:10:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:10:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:47,139 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:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599977295] [2024-11-07 01:10:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599977295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:47,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:10:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117206174] [2024-11-07 01:10:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:47,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:10:47,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:47,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:10:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:10:47,177 INFO L87 Difference]: Start difference. First operand has 2560 states, 2523 states have (on average 1.840665873959572) internal successors, (4644), 2528 states have internal predecessors, (4644), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:48,980 INFO L93 Difference]: Finished difference Result 5238 states and 9599 transitions. [2024-11-07 01:10:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:10:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:10:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:49,018 INFO L225 Difference]: With dead ends: 5238 [2024-11-07 01:10:49,019 INFO L226 Difference]: Without dead ends: 2623 [2024-11-07 01:10:49,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:10:49,035 INFO L432 NwaCegarLoop]: 4371 mSDtfsCounter, 983 mSDsluCounter, 12481 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 16852 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:49,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 16852 Invalid, 1018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:10:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-07 01:10:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2492. [2024-11-07 01:10:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2457 states have (on average 1.8245828245828246) internal successors, (4483), 2460 states have internal predecessors, (4483), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 01:10:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4535 transitions. [2024-11-07 01:10:49,204 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4535 transitions. Word has length 168 [2024-11-07 01:10:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:49,204 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 4535 transitions. [2024-11-07 01:10:49,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4535 transitions. [2024-11-07 01:10:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:10:49,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:49,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:10:49,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash -238073445, now seen corresponding path program 1 times [2024-11-07 01:10:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019513438] [2024-11-07 01:10:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:10:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:10:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:10:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:10:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,745 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:49,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019513438] [2024-11-07 01:10:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019513438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:49,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:10:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585032406] [2024-11-07 01:10:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:49,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:10:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:10:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:10:49,749 INFO L87 Difference]: Start difference. First operand 2492 states and 4535 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:52,653 INFO L93 Difference]: Finished difference Result 3474 states and 6110 transitions. [2024-11-07 01:10:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:10:52,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:10:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:52,670 INFO L225 Difference]: With dead ends: 3474 [2024-11-07 01:10:52,670 INFO L226 Difference]: Without dead ends: 3122 [2024-11-07 01:10:52,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:52,674 INFO L432 NwaCegarLoop]: 4274 mSDtfsCounter, 5431 mSDsluCounter, 12841 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5449 SdHoareTripleChecker+Valid, 17115 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:52,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5449 Valid, 17115 Invalid, 2214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:10:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-11-07 01:10:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2859. [2024-11-07 01:10:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2797 states have (on average 1.794780121558813) internal successors, (5020), 2801 states have internal predecessors, (5020), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-11-07 01:10:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 5115 transitions. [2024-11-07 01:10:52,858 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 5115 transitions. Word has length 168 [2024-11-07 01:10:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:52,859 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 5115 transitions. [2024-11-07 01:10:52,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 5115 transitions. [2024-11-07 01:10:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:10:52,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:52,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:10:52,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 684327063, now seen corresponding path program 1 times [2024-11-07 01:10:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980932634] [2024-11-07 01:10:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:10:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:10:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:10:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:10:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,311 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:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980932634] [2024-11-07 01:10:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980932634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833361210] [2024-11-07 01:10:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:53,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:53,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:53,314 INFO L87 Difference]: Start difference. First operand 2859 states and 5115 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:56,778 INFO L93 Difference]: Finished difference Result 4356 states and 7519 transitions. [2024-11-07 01:10:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:10:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:56,794 INFO L225 Difference]: With dead ends: 4356 [2024-11-07 01:10:56,794 INFO L226 Difference]: Without dead ends: 3637 [2024-11-07 01:10:56,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:56,797 INFO L432 NwaCegarLoop]: 4519 mSDtfsCounter, 5458 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5476 SdHoareTripleChecker+Valid, 22286 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:56,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5476 Valid, 22286 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 01:10:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2024-11-07 01:10:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3201. [2024-11-07 01:10:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3112 states have (on average 1.7696015424164524) internal successors, (5507), 3117 states have internal predecessors, (5507), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-07 01:10:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 5644 transitions. [2024-11-07 01:10:56,900 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 5644 transitions. Word has length 168 [2024-11-07 01:10:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:56,900 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 5644 transitions. [2024-11-07 01:10:56,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 5644 transitions. [2024-11-07 01:10:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:10:56,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:56,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:10:56,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:56,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1713660775, now seen corresponding path program 1 times [2024-11-07 01:10:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429827544] [2024-11-07 01:10:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:57,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:10:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:10:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:10:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:10:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:57,244 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:57,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429827544] [2024-11-07 01:10:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429827544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:57,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:57,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651581606] [2024-11-07 01:10:57,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:57,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:57,247 INFO L87 Difference]: Start difference. First operand 3201 states and 5644 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:00,315 INFO L93 Difference]: Finished difference Result 5657 states and 9580 transitions. [2024-11-07 01:11:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:00,339 INFO L225 Difference]: With dead ends: 5657 [2024-11-07 01:11:00,339 INFO L226 Difference]: Without dead ends: 4596 [2024-11-07 01:11:00,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:00,344 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5456 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:00,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 22284 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:11:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2024-11-07 01:11:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 3886. [2024-11-07 01:11:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3743 states have (on average 1.7317659631311781) internal successors, (6482), 3750 states have internal predecessors, (6482), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-07 01:11:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 6707 transitions. [2024-11-07 01:11:00,503 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 6707 transitions. Word has length 168 [2024-11-07 01:11:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:00,503 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 6707 transitions. [2024-11-07 01:11:00,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 6707 transitions. [2024-11-07 01:11:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:00,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:00,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:11:00,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:00,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1375373225, now seen corresponding path program 1 times [2024-11-07 01:11:00,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616775563] [2024-11-07 01:11:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,801 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:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616775563] [2024-11-07 01:11:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616775563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:00,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078983904] [2024-11-07 01:11:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:00,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:00,804 INFO L87 Difference]: Start difference. First operand 3886 states and 6707 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:04,041 INFO L93 Difference]: Finished difference Result 8162 states and 13523 transitions. [2024-11-07 01:11:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:04,069 INFO L225 Difference]: With dead ends: 8162 [2024-11-07 01:11:04,069 INFO L226 Difference]: Without dead ends: 6416 [2024-11-07 01:11:04,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:04,076 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5452 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5470 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:04,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5470 Valid, 22284 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:11:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6416 states. [2024-11-07 01:11:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6416 to 5257. [2024-11-07 01:11:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5006 states have (on average 1.6843787455053936) internal successors, (8432), 5017 states have internal predecessors, (8432), 187 states have call successors, (187), 55 states have call predecessors, (187), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-07 01:11:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8839 transitions. [2024-11-07 01:11:04,294 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8839 transitions. Word has length 168 [2024-11-07 01:11:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:04,295 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 8839 transitions. [2024-11-07 01:11:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8839 transitions. [2024-11-07 01:11:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:04,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:04,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:11:04,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:04,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash -948818727, now seen corresponding path program 1 times [2024-11-07 01:11:04,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:04,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157851037] [2024-11-07 01:11:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:04,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,582 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:04,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157851037] [2024-11-07 01:11:04,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157851037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:04,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036996465] [2024-11-07 01:11:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:04,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:04,585 INFO L87 Difference]: Start difference. First operand 5257 states and 8839 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:08,112 INFO L93 Difference]: Finished difference Result 13171 states and 21425 transitions. [2024-11-07 01:11:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:08,158 INFO L225 Difference]: With dead ends: 13171 [2024-11-07 01:11:08,158 INFO L226 Difference]: Without dead ends: 10054 [2024-11-07 01:11:08,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:08,174 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5448 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5466 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:08,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5466 Valid, 22284 Invalid, 3385 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:11:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10054 states. [2024-11-07 01:11:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10054 to 8004. [2024-11-07 01:11:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8004 states, 7537 states have (on average 1.6369908451638584) internal successors, (12338), 7556 states have internal predecessors, (12338), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-07 01:11:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8004 states to 8004 states and 13127 transitions. [2024-11-07 01:11:08,590 INFO L78 Accepts]: Start accepts. Automaton has 8004 states and 13127 transitions. Word has length 168 [2024-11-07 01:11:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:08,590 INFO L471 AbstractCegarLoop]: Abstraction has 8004 states and 13127 transitions. [2024-11-07 01:11:08,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 8004 states and 13127 transitions. [2024-11-07 01:11:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:08,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:08,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:11:08,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:08,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:08,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1489248233, now seen corresponding path program 1 times [2024-11-07 01:11:08,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:08,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053696060] [2024-11-07 01:11:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:08,898 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:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053696060] [2024-11-07 01:11:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053696060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:08,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300168279] [2024-11-07 01:11:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:08,900 INFO L87 Difference]: Start difference. First operand 8004 states and 13127 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:12,329 INFO L93 Difference]: Finished difference Result 23188 states and 37287 transitions. [2024-11-07 01:11:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:12,397 INFO L225 Difference]: With dead ends: 23188 [2024-11-07 01:11:12,398 INFO L226 Difference]: Without dead ends: 17324 [2024-11-07 01:11:12,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:12,423 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5450 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5468 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:12,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5468 Valid, 22284 Invalid, 3371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:11:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17324 states. [2024-11-07 01:11:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17324 to 13511. [2024-11-07 01:11:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 12612 states have (on average 1.5991119568664764) internal successors, (20168), 12647 states have internal predecessors, (20168), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-07 01:11:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 21775 transitions. [2024-11-07 01:11:13,128 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 21775 transitions. Word has length 168 [2024-11-07 01:11:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 21775 transitions. [2024-11-07 01:11:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 21775 transitions. [2024-11-07 01:11:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:13,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:13,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:11:13,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:13,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1645228775, now seen corresponding path program 1 times [2024-11-07 01:11:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320252409] [2024-11-07 01:11:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,422 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:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320252409] [2024-11-07 01:11:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320252409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166854759] [2024-11-07 01:11:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:13,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:13,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:13,424 INFO L87 Difference]: Start difference. First operand 13511 states and 21775 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:15,684 INFO L93 Difference]: Finished difference Result 28900 states and 46552 transitions. [2024-11-07 01:11:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:11:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:15,755 INFO L225 Difference]: With dead ends: 28900 [2024-11-07 01:11:15,755 INFO L226 Difference]: Without dead ends: 17529 [2024-11-07 01:11:15,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:11:15,794 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 5043 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 21042 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:15,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 21042 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:11:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2024-11-07 01:11:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 13511. [2024-11-07 01:11:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 12612 states have (on average 1.5964954012052015) internal successors, (20135), 12647 states have internal predecessors, (20135), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-07 01:11:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 21742 transitions. [2024-11-07 01:11:16,494 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 21742 transitions. Word has length 168 [2024-11-07 01:11:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:16,495 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 21742 transitions. [2024-11-07 01:11:16,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 21742 transitions. [2024-11-07 01:11:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:16,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:16,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:11:16,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash 861868699, now seen corresponding path program 1 times [2024-11-07 01:11:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979086432] [2024-11-07 01:11:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:16,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:16,769 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:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979086432] [2024-11-07 01:11:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979086432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706715248] [2024-11-07 01:11:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:16,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:16,770 INFO L87 Difference]: Start difference. First operand 13511 states and 21742 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:20,499 INFO L93 Difference]: Finished difference Result 43156 states and 68909 transitions. [2024-11-07 01:11:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:20,683 INFO L225 Difference]: With dead ends: 43156 [2024-11-07 01:11:20,683 INFO L226 Difference]: Without dead ends: 31785 [2024-11-07 01:11:20,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:20,710 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5439 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5457 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:20,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5457 Valid, 22284 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:11:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31785 states. [2024-11-07 01:11:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31785 to 24620. [2024-11-07 01:11:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24620 states, 22857 states have (on average 1.570853567834799) internal successors, (35905), 22924 states have internal predecessors, (35905), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 454 states have return successors, (2098), 1368 states have call predecessors, (2098), 1305 states have call successors, (2098) [2024-11-07 01:11:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24620 states to 24620 states and 39310 transitions. [2024-11-07 01:11:21,917 INFO L78 Accepts]: Start accepts. Automaton has 24620 states and 39310 transitions. Word has length 168 [2024-11-07 01:11:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:21,918 INFO L471 AbstractCegarLoop]: Abstraction has 24620 states and 39310 transitions. [2024-11-07 01:11:21,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24620 states and 39310 transitions. [2024-11-07 01:11:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:21,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:21,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:11:21,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:21,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1274014503, now seen corresponding path program 1 times [2024-11-07 01:11:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118664421] [2024-11-07 01:11:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:22,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:22,234 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:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118664421] [2024-11-07 01:11:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118664421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:22,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:22,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160980618] [2024-11-07 01:11:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:22,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:22,236 INFO L87 Difference]: Start difference. First operand 24620 states and 39310 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:26,946 INFO L93 Difference]: Finished difference Result 83227 states and 133155 transitions. [2024-11-07 01:11:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:26,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:27,169 INFO L225 Difference]: With dead ends: 83227 [2024-11-07 01:11:27,170 INFO L226 Difference]: Without dead ends: 60747 [2024-11-07 01:11:27,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:27,246 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5438 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5456 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:27,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5456 Valid, 22284 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:11:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60747 states. [2024-11-07 01:11:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60747 to 46897. [2024-11-07 01:11:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46897 states, 43406 states have (on average 1.555798737501728) internal successors, (67531), 43537 states have internal predecessors, (67531), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 902 states have return successors, (4900), 2712 states have call predecessors, (4900), 2585 states have call successors, (4900) [2024-11-07 01:11:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46897 states to 46897 states and 75018 transitions. [2024-11-07 01:11:29,850 INFO L78 Accepts]: Start accepts. Automaton has 46897 states and 75018 transitions. Word has length 168 [2024-11-07 01:11:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:29,850 INFO L471 AbstractCegarLoop]: Abstraction has 46897 states and 75018 transitions. [2024-11-07 01:11:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46897 states and 75018 transitions. [2024-11-07 01:11:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:29,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:29,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:11:29,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1204366629, now seen corresponding path program 1 times [2024-11-07 01:11:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210758846] [2024-11-07 01:11:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:30,176 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:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:30,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210758846] [2024-11-07 01:11:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210758846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785827182] [2024-11-07 01:11:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:30,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:30,178 INFO L87 Difference]: Start difference. First operand 46897 states and 75018 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:36,906 INFO L93 Difference]: Finished difference Result 163366 states and 263489 transitions. [2024-11-07 01:11:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-07 01:11:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:37,634 INFO L225 Difference]: With dead ends: 163366 [2024-11-07 01:11:37,634 INFO L226 Difference]: Without dead ends: 118609 [2024-11-07 01:11:37,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:37,770 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5437 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3227 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5455 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:37,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5455 Valid, 22284 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3227 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:11:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118609 states. [2024-11-07 01:11:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118609 to 91578. [2024-11-07 01:11:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91578 states, 84631 states have (on average 1.5475771289480214) internal successors, (130973), 84890 states have internal predecessors, (130973), 5147 states have call successors, (5147), 1543 states have call predecessors, (5147), 1798 states have return successors, (11962), 5400 states have call predecessors, (11962), 5145 states have call successors, (11962) [2024-11-07 01:11:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91578 states to 91578 states and 148082 transitions. [2024-11-07 01:11:42,795 INFO L78 Accepts]: Start accepts. Automaton has 91578 states and 148082 transitions. Word has length 168 [2024-11-07 01:11:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:42,795 INFO L471 AbstractCegarLoop]: Abstraction has 91578 states and 148082 transitions. [2024-11-07 01:11:42,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 91578 states and 148082 transitions. [2024-11-07 01:11:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:11:42,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:42,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:11:42,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:42,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -786477927, now seen corresponding path program 1 times [2024-11-07 01:11:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:42,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820808733] [2024-11-07 01:11:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:42,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:11:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:11:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:11:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:11:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:43,045 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:43,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820808733] [2024-11-07 01:11:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820808733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:43,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787048920] [2024-11-07 01:11:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:43,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:43,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:43,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:43,048 INFO L87 Difference]: Start difference. First operand 91578 states and 148082 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)