./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.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/systemc/token_ring.06.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', '4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37'] 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/systemc/token_ring.06.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 4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:57:55,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:57:55,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:57:55,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:57:55,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:57:55,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:57:55,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:57:55,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:57:55,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:57:55,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:57:55,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:57:55,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:57:55,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:57:55,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:57:55,124 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:57:55,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:57:55,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:55,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:57:55,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:57:55,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:57:55,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:57:55,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:57:55,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:57:55,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:57:55,126 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 -> 4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37 [2024-11-06 23:57:55,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:57:55,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:57:55,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:57:55,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:57:55,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:57:55,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2024-11-06 23:57:56,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:57:56,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:57:56,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2024-11-06 23:57:56,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9df441fcc/e3e3ca8e7c4940b7b90dfb45b2edb9a1/FLAG751089bce [2024-11-06 23:57:57,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9df441fcc/e3e3ca8e7c4940b7b90dfb45b2edb9a1 [2024-11-06 23:57:57,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:57:57,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:57:57,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:57,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:57:57,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:57:57,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1708449f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57, skipping insertion in model container [2024-11-06 23:57:57,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:57:57,208 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/systemc/token_ring.06.cil-1.c[671,684] [2024-11-06 23:57:57,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:57,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:57:57,286 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/systemc/token_ring.06.cil-1.c[671,684] [2024-11-06 23:57:57,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:57,402 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:57:57,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57 WrapperNode [2024-11-06 23:57:57,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:57,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:57,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:57:57,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:57:57,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,493 INFO L138 Inliner]: procedures = 40, calls = 50, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 525 [2024-11-06 23:57:57,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:57,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:57:57,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:57:57,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:57:57,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,555 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-06 23:57:57,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:57:57,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:57:57,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:57:57,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:57:57,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:57:57,658 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-06 23:57:57,660 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-06 23:57:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:57:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-06 23:57:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-06 23:57:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:57:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:57:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:57:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:57:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-06 23:57:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-06 23:57:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:57:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:57:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:57:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:57:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:57:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:57:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:57:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:57:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:57:57,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:57:57,769 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:57:58,158 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-06 23:57:58,159 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:57:58,167 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:57:58,168 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-06 23:57:58,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:58 BoogieIcfgContainer [2024-11-06 23:57:58,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:57:58,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:57:58,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:57:58,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:57:58,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:57:57" (1/3) ... [2024-11-06 23:57:58,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1091340d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:58, skipping insertion in model container [2024-11-06 23:57:58,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (2/3) ... [2024-11-06 23:57:58,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1091340d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:58, skipping insertion in model container [2024-11-06 23:57:58,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:58" (3/3) ... [2024-11-06 23:57:58,174 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2024-11-06 23:57:58,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:57:58,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:57:58,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:57:58,228 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;@4571a7ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:57:58,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:57:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 216 states have (on average 1.6203703703703705) internal successors, (350), 220 states have internal predecessors, (350), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-06 23:57:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:57:58,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:58,239 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] [2024-11-06 23:57:58,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:58,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:58,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1485619585, now seen corresponding path program 1 times [2024-11-06 23:57:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221385505] [2024-11-06 23:57:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:57:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:57:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:57:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:57:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,553 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-06 23:57:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:58,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221385505] [2024-11-06 23:57:58,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221385505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:58,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:58,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:57:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854136057] [2024-11-06 23:57:58,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:58,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:57:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:57:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:57:58,575 INFO L87 Difference]: Start difference. First operand has 247 states, 216 states have (on average 1.6203703703703705) internal successors, (350), 220 states have internal predecessors, (350), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-06 23:57:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:59,379 INFO L93 Difference]: Finished difference Result 562 states and 910 transitions. [2024-11-06 23:57:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:57:59,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 112 [2024-11-06 23:57:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:59,389 INFO L225 Difference]: With dead ends: 562 [2024-11-06 23:57:59,389 INFO L226 Difference]: Without dead ends: 317 [2024-11-06 23:57:59,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:57:59,395 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 609 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:59,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 506 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:57:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-06 23:57:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 241. [2024-11-06 23:57:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 212 states have (on average 1.5330188679245282) internal successors, (325), 214 states have internal predecessors, (325), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-06 23:57:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 367 transitions. [2024-11-06 23:57:59,437 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 367 transitions. Word has length 112 [2024-11-06 23:57:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:59,437 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 367 transitions. [2024-11-06 23:57:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-06 23:57:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 367 transitions. [2024-11-06 23:57:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:57:59,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:59,439 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] [2024-11-06 23:57:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:57:59,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:59,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1367178111, now seen corresponding path program 1 times [2024-11-06 23:57:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813208205] [2024-11-06 23:57:59,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:57:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:57:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:57:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:57:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,748 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-06 23:57:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813208205] [2024-11-06 23:57:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813208205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:57:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134791187] [2024-11-06 23:57:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:59,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:57:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:59,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:57:59,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:57:59,750 INFO L87 Difference]: Start difference. First operand 241 states and 367 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-06 23:58:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:01,018 INFO L93 Difference]: Finished difference Result 853 states and 1332 transitions. [2024-11-06 23:58:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:58:01,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:01,022 INFO L225 Difference]: With dead ends: 853 [2024-11-06 23:58:01,022 INFO L226 Difference]: Without dead ends: 626 [2024-11-06 23:58:01,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:58:01,028 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 894 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:01,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 925 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 23:58:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-06 23:58:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 473. [2024-11-06 23:58:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 422 states have (on average 1.5450236966824644) internal successors, (652), 425 states have internal predecessors, (652), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-11-06 23:58:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 727 transitions. [2024-11-06 23:58:01,097 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 727 transitions. Word has length 112 [2024-11-06 23:58:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:01,097 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 727 transitions. [2024-11-06 23:58:01,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-06 23:58:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 727 transitions. [2024-11-06 23:58:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:01,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:01,102 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] [2024-11-06 23:58:01,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:58:01,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1933536389, now seen corresponding path program 1 times [2024-11-06 23:58:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128949242] [2024-11-06 23:58:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,361 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-06 23:58:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128949242] [2024-11-06 23:58:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128949242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567624633] [2024-11-06 23:58:01,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:01,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:01,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:01,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:01,363 INFO L87 Difference]: Start difference. First operand 473 states and 727 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:02,945 INFO L93 Difference]: Finished difference Result 1400 states and 2186 transitions. [2024-11-06 23:58:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:02,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:02,950 INFO L225 Difference]: With dead ends: 1400 [2024-11-06 23:58:02,950 INFO L226 Difference]: Without dead ends: 941 [2024-11-06 23:58:02,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:02,951 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 903 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:02,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1621 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-06 23:58:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 690. [2024-11-06 23:58:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 617 states have (on average 1.5380875202593194) internal successors, (949), 621 states have internal predecessors, (949), 52 states have call successors, (52), 19 states have call predecessors, (52), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-06 23:58:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1056 transitions. [2024-11-06 23:58:02,984 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1056 transitions. Word has length 112 [2024-11-06 23:58:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:02,984 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1056 transitions. [2024-11-06 23:58:02,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1056 transitions. [2024-11-06 23:58:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:02,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:02,985 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] [2024-11-06 23:58:02,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:58:02,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -582151171, now seen corresponding path program 1 times [2024-11-06 23:58:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104073907] [2024-11-06 23:58:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,133 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-06 23:58:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104073907] [2024-11-06 23:58:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104073907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361027972] [2024-11-06 23:58:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:03,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:03,134 INFO L87 Difference]: Start difference. First operand 690 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:04,568 INFO L93 Difference]: Finished difference Result 2206 states and 3437 transitions. [2024-11-06 23:58:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:04,577 INFO L225 Difference]: With dead ends: 2206 [2024-11-06 23:58:04,581 INFO L226 Difference]: Without dead ends: 1530 [2024-11-06 23:58:04,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:04,583 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 975 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:04,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 1045 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 23:58:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-06 23:58:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1125. [2024-11-06 23:58:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1008 states have (on average 1.5317460317460319) internal successors, (1544), 1014 states have internal predecessors, (1544), 82 states have call successors, (82), 31 states have call predecessors, (82), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-11-06 23:58:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1719 transitions. [2024-11-06 23:58:04,659 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1719 transitions. Word has length 112 [2024-11-06 23:58:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:04,660 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1719 transitions. [2024-11-06 23:58:04,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1719 transitions. [2024-11-06 23:58:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:04,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:04,661 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] [2024-11-06 23:58:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:58:04,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:04,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2093841211, now seen corresponding path program 1 times [2024-11-06 23:58:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257113262] [2024-11-06 23:58:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:04,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:04,783 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-06 23:58:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257113262] [2024-11-06 23:58:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257113262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958395172] [2024-11-06 23:58:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:04,785 INFO L87 Difference]: Start difference. First operand 1125 states and 1719 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:06,328 INFO L93 Difference]: Finished difference Result 3758 states and 5836 transitions. [2024-11-06 23:58:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:06,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:06,338 INFO L225 Difference]: With dead ends: 3758 [2024-11-06 23:58:06,338 INFO L226 Difference]: Without dead ends: 2647 [2024-11-06 23:58:06,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:06,341 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 901 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:06,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 1619 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2024-11-06 23:58:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2001. [2024-11-06 23:58:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1796 states have (on average 1.5278396436525612) internal successors, (2744), 1806 states have internal predecessors, (2744), 142 states have call successors, (142), 55 states have call predecessors, (142), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-11-06 23:58:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3061 transitions. [2024-11-06 23:58:06,416 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3061 transitions. Word has length 112 [2024-11-06 23:58:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:06,416 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 3061 transitions. [2024-11-06 23:58:06,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3061 transitions. [2024-11-06 23:58:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:06,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:06,418 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] [2024-11-06 23:58:06,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:58:06,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:06,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2065340921, now seen corresponding path program 1 times [2024-11-06 23:58:06,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:06,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767941499] [2024-11-06 23:58:06,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:06,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:06,551 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-06 23:58:06,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:06,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767941499] [2024-11-06 23:58:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767941499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:06,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678936671] [2024-11-06 23:58:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:06,552 INFO L87 Difference]: Start difference. First operand 2001 states and 3061 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:08,084 INFO L93 Difference]: Finished difference Result 6872 states and 10668 transitions. [2024-11-06 23:58:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:08,098 INFO L225 Difference]: With dead ends: 6872 [2024-11-06 23:58:08,098 INFO L226 Difference]: Without dead ends: 4885 [2024-11-06 23:58:08,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:08,103 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 900 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:08,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1619 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 23:58:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2024-11-06 23:58:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 3758. [2024-11-06 23:58:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3377 states have (on average 1.525022209061297) internal successors, (5150), 3395 states have internal predecessors, (5150), 262 states have call successors, (262), 103 states have call predecessors, (262), 118 states have return successors, (357), 275 states have call predecessors, (357), 260 states have call successors, (357) [2024-11-06 23:58:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5769 transitions. [2024-11-06 23:58:08,289 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5769 transitions. Word has length 112 [2024-11-06 23:58:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:08,289 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5769 transitions. [2024-11-06 23:58:08,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5769 transitions. [2024-11-06 23:58:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:08,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:08,292 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] [2024-11-06 23:58:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:58:08,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:08,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash 124758907, now seen corresponding path program 1 times [2024-11-06 23:58:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330215062] [2024-11-06 23:58:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:08,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,413 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-06 23:58:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330215062] [2024-11-06 23:58:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330215062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:08,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:08,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565256446] [2024-11-06 23:58:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:08,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:08,415 INFO L87 Difference]: Start difference. First operand 3758 states and 5769 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:10,072 INFO L93 Difference]: Finished difference Result 13099 states and 20390 transitions. [2024-11-06 23:58:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:10,102 INFO L225 Difference]: With dead ends: 13099 [2024-11-06 23:58:10,103 INFO L226 Difference]: Without dead ends: 9355 [2024-11-06 23:58:10,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:10,113 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 899 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:10,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1619 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 23:58:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2024-11-06 23:58:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 7287. [2024-11-06 23:58:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 6554 states have (on average 1.523344522429051) internal successors, (9984), 6588 states have internal predecessors, (9984), 502 states have call successors, (502), 199 states have call predecessors, (502), 230 states have return successors, (775), 531 states have call predecessors, (775), 500 states have call successors, (775) [2024-11-06 23:58:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 11261 transitions. [2024-11-06 23:58:10,494 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 11261 transitions. Word has length 112 [2024-11-06 23:58:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:10,494 INFO L471 AbstractCegarLoop]: Abstraction has 7287 states and 11261 transitions. [2024-11-06 23:58:10,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 11261 transitions. [2024-11-06 23:58:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:10,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:10,500 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] [2024-11-06 23:58:10,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:58:10,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:10,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2001822137, now seen corresponding path program 1 times [2024-11-06 23:58:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:10,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200755492] [2024-11-06 23:58:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:10,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:10,628 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-06 23:58:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200755492] [2024-11-06 23:58:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200755492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206731730] [2024-11-06 23:58:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:10,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:10,629 INFO L87 Difference]: Start difference. First operand 7287 states and 11261 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:12,947 INFO L93 Difference]: Finished difference Result 28530 states and 44510 transitions. [2024-11-06 23:58:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:13,029 INFO L225 Difference]: With dead ends: 28530 [2024-11-06 23:58:13,029 INFO L226 Difference]: Without dead ends: 21257 [2024-11-06 23:58:13,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:13,051 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1150 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:13,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1609 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21257 states. [2024-11-06 23:58:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21257 to 14280. [2024-11-06 23:58:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14280 states, 12875 states have (on average 1.5249708737864078) internal successors, (19634), 12941 states have internal predecessors, (19634), 950 states have call successors, (950), 391 states have call predecessors, (950), 454 states have return successors, (1741), 1011 states have call predecessors, (1741), 948 states have call successors, (1741) [2024-11-06 23:58:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14280 states to 14280 states and 22325 transitions. [2024-11-06 23:58:13,697 INFO L78 Accepts]: Start accepts. Automaton has 14280 states and 22325 transitions. Word has length 112 [2024-11-06 23:58:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:13,697 INFO L471 AbstractCegarLoop]: Abstraction has 14280 states and 22325 transitions. [2024-11-06 23:58:13,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14280 states and 22325 transitions. [2024-11-06 23:58:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:13,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:13,707 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] [2024-11-06 23:58:13,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:58:13,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1231088571, now seen corresponding path program 1 times [2024-11-06 23:58:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028841193] [2024-11-06 23:58:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,861 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-06 23:58:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028841193] [2024-11-06 23:58:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028841193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:13,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422564566] [2024-11-06 23:58:13,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:13,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:13,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:13,863 INFO L87 Difference]: Start difference. First operand 14280 states and 22325 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:16,976 INFO L93 Difference]: Finished difference Result 55361 states and 87268 transitions. [2024-11-06 23:58:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:16,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:17,113 INFO L225 Difference]: With dead ends: 55361 [2024-11-06 23:58:17,113 INFO L226 Difference]: Without dead ends: 41095 [2024-11-06 23:58:17,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:17,161 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 949 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:17,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1605 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:58:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41095 states. [2024-11-06 23:58:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41095 to 27593. [2024-11-06 23:58:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27593 states, 24876 states have (on average 1.5200192957067054) internal successors, (37812), 25006 states have internal predecessors, (37812), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 902 states have return successors, (4127), 1939 states have call predecessors, (4127), 1812 states have call successors, (4127) [2024-11-06 23:58:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27593 states to 27593 states and 43753 transitions. [2024-11-06 23:58:18,446 INFO L78 Accepts]: Start accepts. Automaton has 27593 states and 43753 transitions. Word has length 112 [2024-11-06 23:58:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:18,446 INFO L471 AbstractCegarLoop]: Abstraction has 27593 states and 43753 transitions. [2024-11-06 23:58:18,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27593 states and 43753 transitions. [2024-11-06 23:58:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:18,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:18,463 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] [2024-11-06 23:58:18,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:58:18,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:18,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash 236394873, now seen corresponding path program 1 times [2024-11-06 23:58:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443410989] [2024-11-06 23:58:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:18,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:18,592 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-06 23:58:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443410989] [2024-11-06 23:58:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443410989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:18,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:18,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423166351] [2024-11-06 23:58:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:18,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:18,594 INFO L87 Difference]: Start difference. First operand 27593 states and 43753 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:23,184 INFO L93 Difference]: Finished difference Result 105920 states and 169322 transitions. [2024-11-06 23:58:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:23,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:23,764 INFO L225 Difference]: With dead ends: 105920 [2024-11-06 23:58:23,768 INFO L226 Difference]: Without dead ends: 78341 [2024-11-06 23:58:23,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:23,903 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1070 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:23,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1609 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78341 states. [2024-11-06 23:58:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78341 to 54794. [2024-11-06 23:58:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54794 states, 49517 states have (on average 1.5223458610174283) internal successors, (75382), 49775 states have internal predecessors, (75382), 3478 states have call successors, (3478), 1543 states have call predecessors, (3478), 1798 states have return successors, (10293), 3731 states have call predecessors, (10293), 3476 states have call successors, (10293) [2024-11-06 23:58:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54794 states to 54794 states and 89153 transitions. [2024-11-06 23:58:27,100 INFO L78 Accepts]: Start accepts. Automaton has 54794 states and 89153 transitions. Word has length 112 [2024-11-06 23:58:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:27,101 INFO L471 AbstractCegarLoop]: Abstraction has 54794 states and 89153 transitions. [2024-11-06 23:58:27,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 54794 states and 89153 transitions. [2024-11-06 23:58:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:27,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:27,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] [2024-11-06 23:58:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 23:58:27,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash -349881349, now seen corresponding path program 1 times [2024-11-06 23:58:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074015606] [2024-11-06 23:58:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,292 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-06 23:58:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074015606] [2024-11-06 23:58:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074015606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:27,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:27,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:27,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218148277] [2024-11-06 23:58:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:27,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:27,294 INFO L87 Difference]: Start difference. First operand 54794 states and 89153 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:35,313 INFO L93 Difference]: Finished difference Result 206463 states and 338816 transitions. [2024-11-06 23:58:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-11-06 23:58:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:36,167 INFO L225 Difference]: With dead ends: 206463 [2024-11-06 23:58:36,167 INFO L226 Difference]: Without dead ends: 151683 [2024-11-06 23:58:36,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:36,308 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1091 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:36,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1043 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 23:58:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151683 states. [2024-11-06 23:58:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151683 to 109067. [2024-11-06 23:58:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109067 states, 98798 states have (on average 1.5248081944978644) internal successors, (150648), 99312 states have internal predecessors, (150648), 6678 states have call successors, (6678), 3079 states have call predecessors, (6678), 3590 states have return successors, (26871), 7187 states have call predecessors, (26871), 6676 states have call successors, (26871) [2024-11-06 23:58:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109067 states to 109067 states and 184197 transitions. [2024-11-06 23:58:41,508 INFO L78 Accepts]: Start accepts. Automaton has 109067 states and 184197 transitions. Word has length 112 [2024-11-06 23:58:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:41,508 INFO L471 AbstractCegarLoop]: Abstraction has 109067 states and 184197 transitions. [2024-11-06 23:58:41,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 109067 states and 184197 transitions. [2024-11-06 23:58:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:58:41,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:41,563 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] [2024-11-06 23:58:41,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:58:41,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:41,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1986511161, now seen corresponding path program 1 times [2024-11-06 23:58:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218931056] [2024-11-06 23:58:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,665 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-06 23:58:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218931056] [2024-11-06 23:58:41,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218931056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:41,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:41,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302861680] [2024-11-06 23:58:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:41,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:41,667 INFO L87 Difference]: Start difference. First operand 109067 states and 184197 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)