./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.13.cil-2.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_label41+token_ring.13.cil-2.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', '6167950643e67727b303c7b99fc0839aa2067301d926538b67f3f160c480440e'] 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_label41+token_ring.13.cil-2.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 6167950643e67727b303c7b99fc0839aa2067301d926538b67f3f160c480440e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:56:25,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:56:26,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:56:26,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:56:26,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:56:26,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:56:26,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:56:26,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:56:26,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:56:26,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:56:26,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:56:26,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:56:26,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:56:26,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:56:26,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:56:26,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:56:26,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:56:26,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:56:26,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:56:26,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:56:26,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:56:26,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:56:26,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:56:26,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:56:26,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:56:26,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:56:26,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:56:26,068 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 -> 6167950643e67727b303c7b99fc0839aa2067301d926538b67f3f160c480440e [2024-11-07 00:56:26,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:56:26,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:56:26,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:56:26,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:56:26,375 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:56:26,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.13.cil-2.c [2024-11-07 00:56:27,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:56:28,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:56:28,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.13.cil-2.c [2024-11-07 00:56:28,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/634b4226d/af39fdba33a24f05a1bd31780f41ecba/FLAG2a0dbea3e [2024-11-07 00:56:28,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/634b4226d/af39fdba33a24f05a1bd31780f41ecba [2024-11-07 00:56:28,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:56:28,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:56:28,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:56:28,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:56:28,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:56:28,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:28" (1/1) ... [2024-11-07 00:56:28,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e282cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:28, skipping insertion in model container [2024-11-07 00:56:28,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:28" (1/1) ... [2024-11-07 00:56:28,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:56:29,633 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_label41+token_ring.13.cil-2.c[376251,376264] [2024-11-07 00:56:29,668 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_label41+token_ring.13.cil-2.c[383339,383352] [2024-11-07 00:56:29,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:56:29,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:56:30,617 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_label41+token_ring.13.cil-2.c[376251,376264] [2024-11-07 00:56:30,628 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_label41+token_ring.13.cil-2.c[383339,383352] [2024-11-07 00:56:30,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:56:30,740 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:56:30,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30 WrapperNode [2024-11-07 00:56:30,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:56:30,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:56:30,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:56:30,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:56:30,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:30,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,202 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-11-07 00:56:31,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:56:31,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:56:31,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:56:31,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:56:31,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:56:31,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:56:31,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:56:31,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:56:31,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:56:31,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (1/1) ... [2024-11-07 00:56:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:56:31,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:56:31,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:56:31,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:56:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:56:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:56:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:56:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:56:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:56:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:56:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:56:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:56:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:56:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:56:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:56:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:56:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:56:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:56:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:56:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:56:32,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:56:32,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:56:40,161 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-11-07 00:56:40,162 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:56:40,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:56:40,227 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-07 00:56:40,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:40 BoogieIcfgContainer [2024-11-07 00:56:40,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:56:40,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:56:40,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:56:40,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:56:40,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:56:28" (1/3) ... [2024-11-07 00:56:40,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6aaee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:40, skipping insertion in model container [2024-11-07 00:56:40,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:30" (2/3) ... [2024-11-07 00:56:40,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6aaee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:40, skipping insertion in model container [2024-11-07 00:56:40,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:40" (3/3) ... [2024-11-07 00:56:40,238 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.13.cil-2.c [2024-11-07 00:56:40,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:56:40,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:56:40,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:56:40,370 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;@4535a0cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:56:40,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:56:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 2604 states, 2568 states have (on average 1.837227414330218) internal successors, (4718), 2571 states have internal predecessors, (4718), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 00:56:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:56:40,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:40,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:40,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:40,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash -481144573, now seen corresponding path program 1 times [2024-11-07 00:56:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786411309] [2024-11-07 00:56:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:56:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:56:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:56:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:41,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:56:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786411309] [2024-11-07 00:56:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786411309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:56:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35556044] [2024-11-07 00:56:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:41,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:56:41,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:56:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:56:41,143 INFO L87 Difference]: Start difference. First operand has 2604 states, 2568 states have (on average 1.837227414330218) internal successors, (4718), 2571 states have internal predecessors, (4718), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 00:56:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:43,380 INFO L93 Difference]: Finished difference Result 5353 states and 9793 transitions. [2024-11-07 00:56:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:56:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 189 [2024-11-07 00:56:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:43,417 INFO L225 Difference]: With dead ends: 5353 [2024-11-07 00:56:43,418 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 00:56:43,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:56:43,437 INFO L432 NwaCegarLoop]: 4406 mSDtfsCounter, 1125 mSDsluCounter, 12519 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 16925 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:43,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 16925 Invalid, 1171 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:56:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 00:56:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 00:56:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.819744204636291) internal successors, (4553), 2504 states have internal predecessors, (4553), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 00:56:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4607 transitions. [2024-11-07 00:56:43,627 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4607 transitions. Word has length 189 [2024-11-07 00:56:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:43,627 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4607 transitions. [2024-11-07 00:56:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 00:56:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4607 transitions. [2024-11-07 00:56:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:56:43,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:43,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:43,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:56:43,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:43,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1484842181, now seen corresponding path program 1 times [2024-11-07 00:56:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:43,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481704371] [2024-11-07 00:56:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:56:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:43,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:56:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:56:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:44,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:56:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481704371] [2024-11-07 00:56:44,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481704371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:44,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:44,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:56:44,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786721251] [2024-11-07 00:56:44,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:44,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:56:44,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:56:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:56:44,018 INFO L87 Difference]: Start difference. First operand 2537 states and 4607 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 00:56:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:46,258 INFO L93 Difference]: Finished difference Result 3089 states and 5491 transitions. [2024-11-07 00:56:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:56:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 189 [2024-11-07 00:56:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:46,273 INFO L225 Difference]: With dead ends: 3089 [2024-11-07 00:56:46,274 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 00:56:46,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:56:46,277 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 1111 mSDsluCounter, 12316 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 16652 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:46,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 16652 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:56:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 00:56:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 00:56:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.8193445243804955) internal successors, (4552), 2504 states have internal predecessors, (4552), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 00:56:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4606 transitions. [2024-11-07 00:56:46,371 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4606 transitions. Word has length 189 [2024-11-07 00:56:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:46,372 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4606 transitions. [2024-11-07 00:56:46,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 00:56:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4606 transitions. [2024-11-07 00:56:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:56:46,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:46,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:46,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:56:46,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:46,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1307026809, now seen corresponding path program 1 times [2024-11-07 00:56:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241648241] [2024-11-07 00:56:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:56:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:56:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:56:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:46,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:56:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:46,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:46,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241648241] [2024-11-07 00:56:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241648241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:56:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551949885] [2024-11-07 00:56:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:56:46,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:56:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:56:46,841 INFO L87 Difference]: Start difference. First operand 2537 states and 4606 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 00:56:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:49,890 INFO L93 Difference]: Finished difference Result 3653 states and 6401 transitions. [2024-11-07 00:56:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:56:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 189 [2024-11-07 00:56:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:49,906 INFO L225 Difference]: With dead ends: 3653 [2024-11-07 00:56:49,906 INFO L226 Difference]: Without dead ends: 3258 [2024-11-07 00:56:49,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:56:49,909 INFO L432 NwaCegarLoop]: 4304 mSDtfsCounter, 5646 mSDsluCounter, 12935 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5666 SdHoareTripleChecker+Valid, 17239 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:49,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5666 Valid, 17239 Invalid, 2544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 00:56:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2024-11-07 00:56:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2953. [2024-11-07 00:56:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2889 states have (on average 1.7871235721703012) internal successors, (5163), 2892 states have internal predecessors, (5163), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-07 00:56:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5264 transitions. [2024-11-07 00:56:50,004 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5264 transitions. Word has length 189 [2024-11-07 00:56:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:50,004 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 5264 transitions. [2024-11-07 00:56:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 00:56:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5264 transitions. [2024-11-07 00:56:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:56:50,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:50,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:56:50,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 711601675, now seen corresponding path program 1 times [2024-11-07 00:56:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133687114] [2024-11-07 00:56:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:56:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:50,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:56:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:50,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:56:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:56:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:50,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133687114] [2024-11-07 00:56:50,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133687114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794946283] [2024-11-07 00:56:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:50,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:50,379 INFO L87 Difference]: Start difference. First operand 2953 states and 5264 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:56:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:54,362 INFO L93 Difference]: Finished difference Result 4659 states and 8012 transitions. [2024-11-07 00:56:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:54,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:56:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:54,382 INFO L225 Difference]: With dead ends: 4659 [2024-11-07 00:56:54,382 INFO L226 Difference]: Without dead ends: 3848 [2024-11-07 00:56:54,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:54,387 INFO L432 NwaCegarLoop]: 4572 mSDtfsCounter, 5693 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5713 SdHoareTripleChecker+Valid, 22527 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:54,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5713 Valid, 22527 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 00:56:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2024-11-07 00:56:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3340. [2024-11-07 00:56:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3340 states, 3247 states have (on average 1.760394210040037) internal successors, (5716), 3251 states have internal predecessors, (5716), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-07 00:56:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 5863 transitions. [2024-11-07 00:56:54,513 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 5863 transitions. Word has length 189 [2024-11-07 00:56:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:54,514 INFO L471 AbstractCegarLoop]: Abstraction has 3340 states and 5863 transitions. [2024-11-07 00:56:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:56:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 5863 transitions. [2024-11-07 00:56:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:56:54,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:54,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:54,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:56:54,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:54,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1013006647, now seen corresponding path program 1 times [2024-11-07 00:56:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868026073] [2024-11-07 00:56:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:56:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:56:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:56:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:56:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:54,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:54,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868026073] [2024-11-07 00:56:54,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868026073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:54,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:54,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867857949] [2024-11-07 00:56:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:54,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:54,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:54,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:54,830 INFO L87 Difference]: Start difference. First operand 3340 states and 5863 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:56:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:58,526 INFO L93 Difference]: Finished difference Result 6142 states and 10367 transitions. [2024-11-07 00:56:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:56:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:58,550 INFO L225 Difference]: With dead ends: 6142 [2024-11-07 00:56:58,550 INFO L226 Difference]: Without dead ends: 4944 [2024-11-07 00:56:58,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:58,558 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5687 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:58,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5707 Valid, 22525 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 00:56:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-11-07 00:56:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4118. [2024-11-07 00:56:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4118 states, 3967 states have (on average 1.7214519788253089) internal successors, (6829), 3973 states have internal predecessors, (6829), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-07 00:56:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 7072 transitions. [2024-11-07 00:56:58,725 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 7072 transitions. Word has length 189 [2024-11-07 00:56:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:58,725 INFO L471 AbstractCegarLoop]: Abstraction has 4118 states and 7072 transitions. [2024-11-07 00:56:58,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:56:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 7072 transitions. [2024-11-07 00:56:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:56:58,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:58,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:58,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:56:58,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:58,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -442734841, now seen corresponding path program 1 times [2024-11-07 00:56:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894587535] [2024-11-07 00:56:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:56:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:56:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:56:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:56:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:59,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894587535] [2024-11-07 00:56:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894587535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:59,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675598393] [2024-11-07 00:56:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:59,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:59,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:59,056 INFO L87 Difference]: Start difference. First operand 4118 states and 7072 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:02,841 INFO L93 Difference]: Finished difference Result 9002 states and 14876 transitions. [2024-11-07 00:57:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:02,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:02,876 INFO L225 Difference]: With dead ends: 9002 [2024-11-07 00:57:02,876 INFO L226 Difference]: Without dead ends: 7026 [2024-11-07 00:57:02,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:57:02,885 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5686 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3811 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5706 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:02,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5706 Valid, 22525 Invalid, 3876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3811 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 00:57:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2024-11-07 00:57:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5675. [2024-11-07 00:57:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5675 states, 5408 states have (on average 1.674371301775148) internal successors, (9055), 5418 states have internal predecessors, (9055), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-07 00:57:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5675 states to 5675 states and 9496 transitions. [2024-11-07 00:57:03,194 INFO L78 Accepts]: Start accepts. Automaton has 5675 states and 9496 transitions. Word has length 189 [2024-11-07 00:57:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:03,195 INFO L471 AbstractCegarLoop]: Abstraction has 5675 states and 9496 transitions. [2024-11-07 00:57:03,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5675 states and 9496 transitions. [2024-11-07 00:57:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:57:03,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:03,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:57:03,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 961134345, now seen corresponding path program 1 times [2024-11-07 00:57:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656564088] [2024-11-07 00:57:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:57:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:57:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:57:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:57:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:03,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:03,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656564088] [2024-11-07 00:57:03,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656564088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:03,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:03,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591989490] [2024-11-07 00:57:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:03,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:03,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:03,529 INFO L87 Difference]: Start difference. First operand 5675 states and 9496 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:07,370 INFO L93 Difference]: Finished difference Result 14721 states and 23910 transitions. [2024-11-07 00:57:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:07,421 INFO L225 Difference]: With dead ends: 14721 [2024-11-07 00:57:07,422 INFO L226 Difference]: Without dead ends: 11188 [2024-11-07 00:57:07,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:57:07,438 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5685 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5705 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:07,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5705 Valid, 22525 Invalid, 3863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:57:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2024-11-07 00:57:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 8796. [2024-11-07 00:57:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8796 states, 8297 states have (on average 1.629143063757985) internal successors, (13517), 8315 states have internal predecessors, (13517), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-07 00:57:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8796 states to 8796 states and 14372 transitions. [2024-11-07 00:57:07,812 INFO L78 Accepts]: Start accepts. Automaton has 8796 states and 14372 transitions. Word has length 189 [2024-11-07 00:57:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 8796 states and 14372 transitions. [2024-11-07 00:57:07,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8796 states and 14372 transitions. [2024-11-07 00:57:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:57:07,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:07,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:57:07,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash 175136455, now seen corresponding path program 1 times [2024-11-07 00:57:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391578970] [2024-11-07 00:57:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:57:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:57:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:57:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:08,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:57:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391578970] [2024-11-07 00:57:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391578970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389824878] [2024-11-07 00:57:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:08,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:08,125 INFO L87 Difference]: Start difference. First operand 8796 states and 14372 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:12,158 INFO L93 Difference]: Finished difference Result 26160 states and 42040 transitions. [2024-11-07 00:57:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:12,227 INFO L225 Difference]: With dead ends: 26160 [2024-11-07 00:57:12,228 INFO L226 Difference]: Without dead ends: 19506 [2024-11-07 00:57:12,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:57:12,252 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 5796 mSDsluCounter, 17215 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5816 SdHoareTripleChecker+Valid, 21529 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:12,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5816 Valid, 21529 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 00:57:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19506 states. [2024-11-07 00:57:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19506 to 15053. [2024-11-07 00:57:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 14090 states have (on average 1.5942512420156139) internal successors, (22463), 14124 states have internal predecessors, (22463), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 00:57:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24200 transitions. [2024-11-07 00:57:12,939 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24200 transitions. Word has length 189 [2024-11-07 00:57:12,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:12,939 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24200 transitions. [2024-11-07 00:57:12,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24200 transitions. [2024-11-07 00:57:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:57:12,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:12,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:12,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:57:12,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 842518345, now seen corresponding path program 1 times [2024-11-07 00:57:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532265634] [2024-11-07 00:57:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:57:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:13,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:57:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:57:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:57:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532265634] [2024-11-07 00:57:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532265634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884713450] [2024-11-07 00:57:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:13,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:13,262 INFO L87 Difference]: Start difference. First operand 15053 states and 24200 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:15,900 INFO L93 Difference]: Finished difference Result 32698 states and 52633 transitions. [2024-11-07 00:57:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:57:15,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:15,964 INFO L225 Difference]: With dead ends: 32698 [2024-11-07 00:57:15,965 INFO L226 Difference]: Without dead ends: 19787 [2024-11-07 00:57:15,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:57:16,000 INFO L432 NwaCegarLoop]: 4289 mSDtfsCounter, 5194 mSDsluCounter, 16880 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:16,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 21169 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:57:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19787 states. [2024-11-07 00:57:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19787 to 15053. [2024-11-07 00:57:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 14090 states have (on average 1.5919091554293825) internal successors, (22430), 14124 states have internal predecessors, (22430), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 00:57:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24167 transitions. [2024-11-07 00:57:16,692 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24167 transitions. Word has length 189 [2024-11-07 00:57:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:16,692 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24167 transitions. [2024-11-07 00:57:16,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24167 transitions. [2024-11-07 00:57:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:57:16,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:16,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:57:16,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:16,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1352710521, now seen corresponding path program 1 times [2024-11-07 00:57:16,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:16,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395523583] [2024-11-07 00:57:16,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:57:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:57:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:57:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:57:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:16,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395523583] [2024-11-07 00:57:16,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395523583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:16,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:16,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389708464] [2024-11-07 00:57:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:16,993 INFO L87 Difference]: Start difference. First operand 15053 states and 24167 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:21,794 INFO L93 Difference]: Finished difference Result 49005 states and 78262 transitions. [2024-11-07 00:57:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:21,918 INFO L225 Difference]: With dead ends: 49005 [2024-11-07 00:57:21,919 INFO L226 Difference]: Without dead ends: 36094 [2024-11-07 00:57:21,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:57:21,962 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5676 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:21,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 22525 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:57:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36094 states. [2024-11-07 00:57:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36094 to 27631. [2024-11-07 00:57:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27631 states, 25740 states have (on average 1.5683760683760684) internal successors, (40370), 25806 states have internal predecessors, (40370), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-07 00:57:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 44033 transitions. [2024-11-07 00:57:23,305 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 44033 transitions. Word has length 189 [2024-11-07 00:57:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:23,307 INFO L471 AbstractCegarLoop]: Abstraction has 27631 states and 44033 transitions. [2024-11-07 00:57:23,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 44033 transitions. [2024-11-07 00:57:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:57:23,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:23,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:57:23,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:23,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1007882359, now seen corresponding path program 1 times [2024-11-07 00:57:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033967561] [2024-11-07 00:57:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:57:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:57:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:57:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:57:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:23,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:23,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033967561] [2024-11-07 00:57:23,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033967561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:23,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:23,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650882713] [2024-11-07 00:57:23,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:23,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:23,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:23,616 INFO L87 Difference]: Start difference. First operand 27631 states and 44033 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:29,380 INFO L93 Difference]: Finished difference Result 94765 states and 151582 transitions. [2024-11-07 00:57:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:29,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:29,588 INFO L225 Difference]: With dead ends: 94765 [2024-11-07 00:57:29,589 INFO L226 Difference]: Without dead ends: 69276 [2024-11-07 00:57:29,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:57:29,665 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5681 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3729 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5701 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:29,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5701 Valid, 22525 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3729 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:57:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69276 states. [2024-11-07 00:57:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69276 to 52848. [2024-11-07 00:57:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52848 states, 49101 states have (on average 1.5547544856520235) internal successors, (76340), 49231 states have internal predecessors, (76340), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-07 00:57:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52848 states to 52848 states and 84341 transitions. [2024-11-07 00:57:32,129 INFO L78 Accepts]: Start accepts. Automaton has 52848 states and 84341 transitions. Word has length 189 [2024-11-07 00:57:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 52848 states and 84341 transitions. [2024-11-07 00:57:32,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 52848 states and 84341 transitions. [2024-11-07 00:57:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:57:32,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:32,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:32,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:57:32,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:32,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:32,161 INFO L85 PathProgramCache]: Analyzing trace with hash -26927545, now seen corresponding path program 1 times [2024-11-07 00:57:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:32,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102885297] [2024-11-07 00:57:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:32,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:57:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:57:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:57:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:57:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102885297] [2024-11-07 00:57:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102885297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031779638] [2024-11-07 00:57:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:32,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:32,433 INFO L87 Difference]: Start difference. First operand 52848 states and 84341 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 00:57:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:37,247 INFO L93 Difference]: Finished difference Result 120952 states and 195834 transitions. [2024-11-07 00:57:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:57:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2024-11-07 00:57:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:37,543 INFO L225 Difference]: With dead ends: 120952 [2024-11-07 00:57:37,544 INFO L226 Difference]: Without dead ends: 70246 [2024-11-07 00:57:37,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:57:37,654 INFO L432 NwaCegarLoop]: 4289 mSDtfsCounter, 5198 mSDsluCounter, 16880 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5219 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:37,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5219 Valid, 21169 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:57:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70246 states.