./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:01:31,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:01:31,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:01:31,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:01:31,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:01:31,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:01:31,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:01:31,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:01:31,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:01:31,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:01:31,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:01:31,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:01:31,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:01:31,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:01:31,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:01:31,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:01:31,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:01:31,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:01:31,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:01:31,728 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 -> a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8 [2024-11-07 01:01:31,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:01:31,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:01:31,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:01:31,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:01:31,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:01:31,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c [2024-11-07 01:01:33,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:01:33,522 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:01:33,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c [2024-11-07 01:01:33,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9d3cce97/7c2a1011803c4c31bbaa561bcbf592fb/FLAG516a99c6b [2024-11-07 01:01:33,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9d3cce97/7c2a1011803c4c31bbaa561bcbf592fb [2024-11-07 01:01:33,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:01:33,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:01:33,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:01:33,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:01:33,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:01:33,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:01:33" (1/1) ... [2024-11-07 01:01:33,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6d0c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:33, skipping insertion in model container [2024-11-07 01:01:33,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:01:33" (1/1) ... [2024-11-07 01:01:33,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:01:34,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c[377340,377353] [2024-11-07 01:01:34,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c[383339,383352] [2024-11-07 01:01:35,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:01:35,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:01:35,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c[377340,377353] [2024-11-07 01:01:35,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c[383339,383352] [2024-11-07 01:01:35,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:01:36,064 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:01:36,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36 WrapperNode [2024-11-07 01:01:36,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:01:36,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:01:36,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:01:36,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:01:36,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,465 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-11-07 01:01:36,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:01:36,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:01:36,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:01:36,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:01:36,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,552 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:01:36,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:01:36,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:01:36,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:01:36,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:01:36,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (1/1) ... [2024-11-07 01:01:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:01:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:01:36,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:01:36,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:01:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:01:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:01:36,866 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:01:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:01:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:01:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:01:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:01:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:01:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:01:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:01:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:01:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:01:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:01:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:01:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:01:36,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:01:36,993 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:01:36,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:01:43,190 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-11-07 01:01:43,191 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:01:43,240 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:01:43,241 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 01:01:43,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:01:43 BoogieIcfgContainer [2024-11-07 01:01:43,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:01:43,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:01:43,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:01:43,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:01:43,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:01:33" (1/3) ... [2024-11-07 01:01:43,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faabc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:01:43, skipping insertion in model container [2024-11-07 01:01:43,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:36" (2/3) ... [2024-11-07 01:01:43,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faabc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:01:43, skipping insertion in model container [2024-11-07 01:01:43,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:01:43" (3/3) ... [2024-11-07 01:01:43,252 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.08.cil-1.c [2024-11-07 01:01:43,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:01:43,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:01:43,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:01:43,381 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;@72547730, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:01:43,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:01:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:01:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:43,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:43,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash -372695446, now seen corresponding path program 1 times [2024-11-07 01:01:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030167439] [2024-11-07 01:01:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:43,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030167439] [2024-11-07 01:01:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030167439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:01:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11798019] [2024-11-07 01:01:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:43,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:01:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:43,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:01:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:01:43,920 INFO L87 Difference]: Start difference. First operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:45,287 INFO L93 Difference]: Finished difference Result 5040 states and 9262 transitions. [2024-11-07 01:01:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:01:45,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:45,304 INFO L225 Difference]: With dead ends: 5040 [2024-11-07 01:01:45,304 INFO L226 Difference]: Without dead ends: 2505 [2024-11-07 01:01:45,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:01:45,312 INFO L432 NwaCegarLoop]: 4291 mSDtfsCounter, 747 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 16670 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:45,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 16670 Invalid, 776 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:01:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-07 01:01:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2407. [2024-11-07 01:01:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2377 states have (on average 1.831299957930164) internal successors, (4353), 2379 states have internal predecessors, (4353), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:01:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4397 transitions. [2024-11-07 01:01:45,417 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4397 transitions. Word has length 134 [2024-11-07 01:01:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:01:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 4397 transitions. [2024-11-07 01:01:45,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4397 transitions. [2024-11-07 01:01:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:45,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:45,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:01:45,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 333901160, now seen corresponding path program 1 times [2024-11-07 01:01:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:45,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423815813] [2024-11-07 01:01:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:45,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:45,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:45,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423815813] [2024-11-07 01:01:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423815813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:45,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:01:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332477440] [2024-11-07 01:01:45,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:01:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:01:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:01:45,743 INFO L87 Difference]: Start difference. First operand 2407 states and 4397 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:47,489 INFO L93 Difference]: Finished difference Result 3153 states and 5582 transitions. [2024-11-07 01:01:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:01:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:47,500 INFO L225 Difference]: With dead ends: 3153 [2024-11-07 01:01:47,501 INFO L226 Difference]: Without dead ends: 2883 [2024-11-07 01:01:47,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:01:47,503 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5067 mSDsluCounter, 12602 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 16802 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:47,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 16802 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:01:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-11-07 01:01:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2688. [2024-11-07 01:01:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2634 states have (on average 1.8048595292331056) internal successors, (4754), 2637 states have internal predecessors, (4754), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-07 01:01:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4835 transitions. [2024-11-07 01:01:47,592 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4835 transitions. Word has length 134 [2024-11-07 01:01:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:01:47,592 INFO L471 AbstractCegarLoop]: Abstraction has 2688 states and 4835 transitions. [2024-11-07 01:01:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4835 transitions. [2024-11-07 01:01:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:47,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:47,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:01:47,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1372602388, now seen corresponding path program 1 times [2024-11-07 01:01:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444005924] [2024-11-07 01:01:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:47,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:47,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444005924] [2024-11-07 01:01:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444005924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:47,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:47,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:01:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591446702] [2024-11-07 01:01:47,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:47,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:01:47,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:47,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:01:47,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:01:47,871 INFO L87 Difference]: Start difference. First operand 2688 states and 4835 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:50,142 INFO L93 Difference]: Finished difference Result 3824 states and 6638 transitions. [2024-11-07 01:01:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:01:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:50,155 INFO L225 Difference]: With dead ends: 3824 [2024-11-07 01:01:50,155 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 01:01:50,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:01:50,158 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5086 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5101 SdHoareTripleChecker+Valid, 21656 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:50,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5101 Valid, 21656 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:01:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 01:01:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2950. [2024-11-07 01:01:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2872 states have (on average 1.7816852367688023) internal successors, (5117), 2876 states have internal predecessors, (5117), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-07 01:01:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5234 transitions. [2024-11-07 01:01:50,227 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5234 transitions. Word has length 134 [2024-11-07 01:01:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:01:50,228 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 5234 transitions. [2024-11-07 01:01:50,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5234 transitions. [2024-11-07 01:01:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:50,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:50,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:50,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:01:50,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:50,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 629283882, now seen corresponding path program 1 times [2024-11-07 01:01:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:50,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764137724] [2024-11-07 01:01:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:50,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764137724] [2024-11-07 01:01:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764137724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:50,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:50,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:01:50,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802451625] [2024-11-07 01:01:50,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:50,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:01:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:50,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:01:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:01:50,466 INFO L87 Difference]: Start difference. First operand 2950 states and 5234 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:52,249 INFO L93 Difference]: Finished difference Result 4813 states and 8183 transitions. [2024-11-07 01:01:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:01:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:52,268 INFO L225 Difference]: With dead ends: 4813 [2024-11-07 01:01:52,268 INFO L226 Difference]: Without dead ends: 4000 [2024-11-07 01:01:52,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:01:52,272 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 5166 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 20993 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:52,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 20993 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:01:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2024-11-07 01:01:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3475. [2024-11-07 01:01:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3349 states have (on average 1.74499850701702) internal successors, (5844), 3355 states have internal predecessors, (5844), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-07 01:01:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 6037 transitions. [2024-11-07 01:01:52,371 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 6037 transitions. Word has length 134 [2024-11-07 01:01:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:01:52,371 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 6037 transitions. [2024-11-07 01:01:52,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 6037 transitions. [2024-11-07 01:01:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:52,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:52,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:52,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:01:52,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:52,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:52,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1938538452, now seen corresponding path program 1 times [2024-11-07 01:01:52,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:52,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992309285] [2024-11-07 01:01:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:52,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:52,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992309285] [2024-11-07 01:01:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992309285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:52,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:52,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:01:52,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006907664] [2024-11-07 01:01:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:52,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:01:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:52,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:01:52,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:01:52,575 INFO L87 Difference]: Start difference. First operand 3475 states and 6037 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:54,389 INFO L93 Difference]: Finished difference Result 6718 states and 11142 transitions. [2024-11-07 01:01:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:01:54,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:54,409 INFO L225 Difference]: With dead ends: 6718 [2024-11-07 01:01:54,409 INFO L226 Difference]: Without dead ends: 5380 [2024-11-07 01:01:54,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:01:54,413 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5084 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:54,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 21654 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:01:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2024-11-07 01:01:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4526. [2024-11-07 01:01:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 4304 states have (on average 1.695631970260223) internal successors, (7298), 4314 states have internal predecessors, (7298), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:01:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 7649 transitions. [2024-11-07 01:01:54,524 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 7649 transitions. Word has length 134 [2024-11-07 01:01:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:01:54,524 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 7649 transitions. [2024-11-07 01:01:54,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 7649 transitions. [2024-11-07 01:01:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:54,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:54,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:54,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:01:54,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:54,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1467182102, now seen corresponding path program 1 times [2024-11-07 01:01:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626186339] [2024-11-07 01:01:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:54,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:54,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626186339] [2024-11-07 01:01:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626186339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:54,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:01:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418797848] [2024-11-07 01:01:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:54,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:01:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:01:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:01:54,667 INFO L87 Difference]: Start difference. First operand 4526 states and 7649 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:57,104 INFO L93 Difference]: Finished difference Result 10520 states and 17064 transitions. [2024-11-07 01:01:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:01:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:57,138 INFO L225 Difference]: With dead ends: 10520 [2024-11-07 01:01:57,141 INFO L226 Difference]: Without dead ends: 8131 [2024-11-07 01:01:57,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:01:57,151 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5080 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:57,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 21654 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:01:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8131 states. [2024-11-07 01:01:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8131 to 6642. [2024-11-07 01:01:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6642 states, 6228 states have (on average 1.642581888246628) internal successors, (10230), 6246 states have internal predecessors, (10230), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-07 01:01:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6642 states to 6642 states and 10915 transitions. [2024-11-07 01:01:57,370 INFO L78 Accepts]: Start accepts. Automaton has 6642 states and 10915 transitions. Word has length 134 [2024-11-07 01:01:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:01:57,371 INFO L471 AbstractCegarLoop]: Abstraction has 6642 states and 10915 transitions. [2024-11-07 01:01:57,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6642 states and 10915 transitions. [2024-11-07 01:01:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:01:57,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:01:57,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:01:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:01:57,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:01:57,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:01:57,377 INFO L85 PathProgramCache]: Analyzing trace with hash 696434472, now seen corresponding path program 1 times [2024-11-07 01:01:57,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:01:57,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016808970] [2024-11-07 01:01:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:01:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:01:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:01:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:01:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:01:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:01:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:01:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:01:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:01:57,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:01:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016808970] [2024-11-07 01:01:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016808970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:01:57,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:01:57,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:01:57,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768749039] [2024-11-07 01:01:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:01:57,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:01:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:01:57,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:01:57,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:01:57,558 INFO L87 Difference]: Start difference. First operand 6642 states and 10915 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:01:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:01:59,776 INFO L93 Difference]: Finished difference Result 18142 states and 29000 transitions. [2024-11-07 01:01:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:01:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:01:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:01:59,819 INFO L225 Difference]: With dead ends: 18142 [2024-11-07 01:01:59,820 INFO L226 Difference]: Without dead ends: 13637 [2024-11-07 01:01:59,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:01:59,837 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5079 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5094 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:01:59,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5094 Valid, 21654 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:01:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2024-11-07 01:02:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 10887. [2024-11-07 01:02:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5969868173258004) internal successors, (16112), 10123 states have internal predecessors, (16112), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 01:02:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17519 transitions. [2024-11-07 01:02:00,388 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17519 transitions. Word has length 134 [2024-11-07 01:02:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:02:00,388 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17519 transitions. [2024-11-07 01:02:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17519 transitions. [2024-11-07 01:02:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:02:00,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:02:00,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:02:00,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:02:00,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:02:00,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:02:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash -342150102, now seen corresponding path program 1 times [2024-11-07 01:02:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:02:00,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898375154] [2024-11-07 01:02:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:02:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:02:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:02:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:02:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:02:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:00,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:02:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:00,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:02:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:02:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:02:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898375154] [2024-11-07 01:02:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898375154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:02:00,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:02:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:02:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896249640] [2024-11-07 01:02:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:02:00,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:02:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:02:00,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:02:00,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:02:00,625 INFO L87 Difference]: Start difference. First operand 10887 states and 17519 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:02:02,041 INFO L93 Difference]: Finished difference Result 22528 states and 36089 transitions. [2024-11-07 01:02:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:02:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:02:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:02:02,090 INFO L225 Difference]: With dead ends: 22528 [2024-11-07 01:02:02,090 INFO L226 Difference]: Without dead ends: 13778 [2024-11-07 01:02:02,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:02:02,105 INFO L432 NwaCegarLoop]: 4185 mSDtfsCounter, 4780 mSDsluCounter, 16543 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 20728 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:02:02,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 20728 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:02:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2024-11-07 01:02:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 10887. [2024-11-07 01:02:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5937159282386757) internal successors, (16079), 10123 states have internal predecessors, (16079), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 01:02:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17486 transitions. [2024-11-07 01:02:02,437 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17486 transitions. Word has length 134 [2024-11-07 01:02:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:02:02,437 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17486 transitions. [2024-11-07 01:02:02,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17486 transitions. [2024-11-07 01:02:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:02:02,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:02:02,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:02:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:02:02,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:02:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:02:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1979651816, now seen corresponding path program 1 times [2024-11-07 01:02:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:02:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494658291] [2024-11-07 01:02:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:02:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:02:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:02:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:02:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:02:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:02:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:02:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:02:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:02:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494658291] [2024-11-07 01:02:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494658291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:02:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:02:02,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:02:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343475519] [2024-11-07 01:02:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:02:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:02:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:02:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:02:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:02:02,659 INFO L87 Difference]: Start difference. First operand 10887 states and 17486 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:02:05,431 INFO L93 Difference]: Finished difference Result 33351 states and 52830 transitions. [2024-11-07 01:02:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:02:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:02:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:02:05,503 INFO L225 Difference]: With dead ends: 33351 [2024-11-07 01:02:05,503 INFO L226 Difference]: Without dead ends: 24601 [2024-11-07 01:02:05,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:02:05,540 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5071 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5086 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:02:05,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5086 Valid, 21654 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:02:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24601 states. [2024-11-07 01:02:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24601 to 19441. [2024-11-07 01:02:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19441 states, 17875 states have (on average 1.5603356643356643) internal successors, (27891), 17941 states have internal predecessors, (27891), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 454 states have return successors, (1903), 1173 states have call predecessors, (1903), 1110 states have call successors, (1903) [2024-11-07 01:02:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19441 states to 19441 states and 30904 transitions. [2024-11-07 01:02:06,307 INFO L78 Accepts]: Start accepts. Automaton has 19441 states and 30904 transitions. Word has length 134 [2024-11-07 01:02:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:02:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 19441 states and 30904 transitions. [2024-11-07 01:02:06,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19441 states and 30904 transitions. [2024-11-07 01:02:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:02:06,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:02:06,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:02:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:02:06,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:02:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:02:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -162208662, now seen corresponding path program 1 times [2024-11-07 01:02:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:02:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477936386] [2024-11-07 01:02:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:02:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:02:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:02:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:02:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:02:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:02:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:02:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:02:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:02:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477936386] [2024-11-07 01:02:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477936386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:02:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:02:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:02:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957044071] [2024-11-07 01:02:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:02:06,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:02:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:02:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:02:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:02:06,589 INFO L87 Difference]: Start difference. First operand 19441 states and 30904 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:02:10,868 INFO L93 Difference]: Finished difference Result 71583 states and 113144 transitions. [2024-11-07 01:02:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:02:10,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:02:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:02:11,101 INFO L225 Difference]: With dead ends: 71583 [2024-11-07 01:02:11,102 INFO L226 Difference]: Without dead ends: 54279 [2024-11-07 01:02:11,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:02:11,151 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5400 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5424 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:02:11,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5424 Valid, 21644 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:02:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54279 states. [2024-11-07 01:02:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54279 to 36418. [2024-11-07 01:02:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36418 states, 33380 states have (on average 1.5421509886159377) internal successors, (51477), 33510 states have internal predecessors, (51477), 2134 states have call successors, (2134), 774 states have call predecessors, (2134), 902 states have return successors, (4449), 2261 states have call predecessors, (4449), 2134 states have call successors, (4449) [2024-11-07 01:02:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36418 states to 36418 states and 58060 transitions. [2024-11-07 01:02:12,820 INFO L78 Accepts]: Start accepts. Automaton has 36418 states and 58060 transitions. Word has length 134 [2024-11-07 01:02:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:02:12,821 INFO L471 AbstractCegarLoop]: Abstraction has 36418 states and 58060 transitions. [2024-11-07 01:02:12,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 36418 states and 58060 transitions. [2024-11-07 01:02:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:02:12,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:02:12,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:02:12,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:02:12,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:02:12,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:02:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash -785490264, now seen corresponding path program 1 times [2024-11-07 01:02:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:02:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963703469] [2024-11-07 01:02:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:02:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:02:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:02:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:02:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:02:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:02:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:02:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:02:13,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:02:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963703469] [2024-11-07 01:02:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963703469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:02:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:02:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:02:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900870712] [2024-11-07 01:02:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:02:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:02:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:02:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:02:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:02:13,082 INFO L87 Difference]: Start difference. First operand 36418 states and 58060 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:02:19,333 INFO L93 Difference]: Finished difference Result 138190 states and 220638 transitions. [2024-11-07 01:02:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:02:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:02:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:02:19,678 INFO L225 Difference]: With dead ends: 138190 [2024-11-07 01:02:19,678 INFO L226 Difference]: Without dead ends: 103909 [2024-11-07 01:02:19,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:02:19,781 INFO L432 NwaCegarLoop]: 4236 mSDtfsCounter, 5209 mSDsluCounter, 16803 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21039 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:02:19,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21039 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:02:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103909 states. [2024-11-07 01:02:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103909 to 69667. [2024-11-07 01:02:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69667 states, 63749 states have (on average 1.532369135202121) internal successors, (97687), 64007 states have internal predecessors, (97687), 4118 states have call successors, (4118), 1542 states have call predecessors, (4118), 1798 states have return successors, (10935), 4373 states have call predecessors, (10935), 4118 states have call successors, (10935) [2024-11-07 01:02:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69667 states to 69667 states and 112740 transitions. [2024-11-07 01:02:24,865 INFO L78 Accepts]: Start accepts. Automaton has 69667 states and 112740 transitions. Word has length 134 [2024-11-07 01:02:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:02:24,865 INFO L471 AbstractCegarLoop]: Abstraction has 69667 states and 112740 transitions. [2024-11-07 01:02:24,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:02:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 69667 states and 112740 transitions. [2024-11-07 01:02:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:02:24,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:02:24,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:02:24,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:02:24,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:02:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:02:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash -667048790, now seen corresponding path program 1 times [2024-11-07 01:02:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:02:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254075521] [2024-11-07 01:02:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:02:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:02:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:02:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:24,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:02:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:02:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:02:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:02:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:02:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:02:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:02:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254075521] [2024-11-07 01:02:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254075521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:02:25,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:02:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:02:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392273282] [2024-11-07 01:02:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:02:25,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:02:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:02:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:02:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:02:25,037 INFO L87 Difference]: Start difference. First operand 69667 states and 112740 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)