./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f'] 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_label47+token_ring.08.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:07:23,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:07:23,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:07:23,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:07:23,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:07:23,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:07:23,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:07:23,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:07:23,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:07:23,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:07:23,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:07:23,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:07:23,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:07:23,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:07:23,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:07:23,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:07:23,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:07:23,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:07:23,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:07:23,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:07:23,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:07:23,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:07:23,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:07:23,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:07:23,901 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 -> d4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f [2024-11-07 01:07:24,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:07:24,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:07:24,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:07:24,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:07:24,137 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:07:24,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c [2024-11-07 01:07:25,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:07:25,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:07:25,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c [2024-11-07 01:07:25,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3658c40f7/d5351c3fef7d46a18f1e28ce71fd9928/FLAG843b91ec2 [2024-11-07 01:07:25,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3658c40f7/d5351c3fef7d46a18f1e28ce71fd9928 [2024-11-07 01:07:25,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:07:25,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:07:25,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:07:25,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:07:25,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:07:25,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:25" (1/1) ... [2024-11-07 01:07:25,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d42c0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:25, skipping insertion in model container [2024-11-07 01:07:25,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:25" (1/1) ... [2024-11-07 01:07:26,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:07:27,101 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_label47+token_ring.08.cil-1.c[377612,377625] [2024-11-07 01:07:27,159 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_label47+token_ring.08.cil-1.c[383339,383352] [2024-11-07 01:07:27,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:07:27,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:07:27,888 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_label47+token_ring.08.cil-1.c[377612,377625] [2024-11-07 01:07:27,892 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_label47+token_ring.08.cil-1.c[383339,383352] [2024-11-07 01:07:27,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:07:27,998 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:07:27,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27 WrapperNode [2024-11-07 01:07:28,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:07:28,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:07:28,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:07:28,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:07:28,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,510 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-11-07 01:07:28,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:07:28,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:07:28,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:07:28,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:07:28,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:07:28,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:28,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:29,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:29,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:29,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:29,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:07:29,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:07:29,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:07:29,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:07:29,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (1/1) ... [2024-11-07 01:07:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:07:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:07:29,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:07:29,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:07:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:07:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:07:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:07:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:07:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:07:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:07:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:07:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:07:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:07:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:07:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:07:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:07:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:07:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:07:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:07:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:07:29,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:07:29,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:07:35,853 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-11-07 01:07:35,854 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:07:35,899 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:07:35,899 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 01:07:35,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:35 BoogieIcfgContainer [2024-11-07 01:07:35,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:07:35,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:07:35,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:07:35,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:07:35,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:25" (1/3) ... [2024-11-07 01:07:35,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2df66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:35, skipping insertion in model container [2024-11-07 01:07:35,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:27" (2/3) ... [2024-11-07 01:07:35,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2df66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:35, skipping insertion in model container [2024-11-07 01:07:35,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:35" (3/3) ... [2024-11-07 01:07:35,910 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.08.cil-1.c [2024-11-07 01:07:35,919 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:07:35,919 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:07:36,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:07:36,016 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;@fa47ab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:07:36,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:07:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:07:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:36,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:36,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:36,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash -372695446, now seen corresponding path program 1 times [2024-11-07 01:07:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621489526] [2024-11-07 01:07:36,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:36,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:36,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:36,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621489526] [2024-11-07 01:07:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621489526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:07:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831124974] [2024-11-07 01:07:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:36,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:07:36,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:36,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:07:36,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:07:36,523 INFO L87 Difference]: Start difference. First operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:37,771 INFO L93 Difference]: Finished difference Result 5040 states and 9262 transitions. [2024-11-07 01:07:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:07:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:37,806 INFO L225 Difference]: With dead ends: 5040 [2024-11-07 01:07:37,807 INFO L226 Difference]: Without dead ends: 2505 [2024-11-07 01:07:37,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:07:37,823 INFO L432 NwaCegarLoop]: 4291 mSDtfsCounter, 747 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 16670 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:37,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 16670 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:07:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-07 01:07:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2407. [2024-11-07 01:07:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2377 states have (on average 1.831299957930164) internal successors, (4353), 2379 states have internal predecessors, (4353), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:07:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4397 transitions. [2024-11-07 01:07:37,981 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4397 transitions. Word has length 134 [2024-11-07 01:07:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:37,981 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 4397 transitions. [2024-11-07 01:07:37,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4397 transitions. [2024-11-07 01:07:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:37,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:37,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:37,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:07:37,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 333901160, now seen corresponding path program 1 times [2024-11-07 01:07:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928554271] [2024-11-07 01:07:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:38,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:38,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928554271] [2024-11-07 01:07:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928554271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:38,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:38,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:07:38,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507218180] [2024-11-07 01:07:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:38,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:07:38,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:07:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:07:38,377 INFO L87 Difference]: Start difference. First operand 2407 states and 4397 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:39,951 INFO L93 Difference]: Finished difference Result 3153 states and 5582 transitions. [2024-11-07 01:07:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:07:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:39,964 INFO L225 Difference]: With dead ends: 3153 [2024-11-07 01:07:39,964 INFO L226 Difference]: Without dead ends: 2883 [2024-11-07 01:07:39,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:07:39,967 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5067 mSDsluCounter, 12602 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 16802 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:39,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 16802 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:07:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-11-07 01:07:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2688. [2024-11-07 01:07:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2634 states have (on average 1.8048595292331056) internal successors, (4754), 2637 states have internal predecessors, (4754), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-07 01:07:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4835 transitions. [2024-11-07 01:07:40,042 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4835 transitions. Word has length 134 [2024-11-07 01:07:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:40,042 INFO L471 AbstractCegarLoop]: Abstraction has 2688 states and 4835 transitions. [2024-11-07 01:07:40,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4835 transitions. [2024-11-07 01:07:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:40,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:40,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:40,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:07:40,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1372602388, now seen corresponding path program 1 times [2024-11-07 01:07:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632308221] [2024-11-07 01:07:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:40,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632308221] [2024-11-07 01:07:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632308221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:40,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565494096] [2024-11-07 01:07:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:40,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:40,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:40,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:40,283 INFO L87 Difference]: Start difference. First operand 2688 states and 4835 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:42,569 INFO L93 Difference]: Finished difference Result 3824 states and 6638 transitions. [2024-11-07 01:07:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:42,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:42,600 INFO L225 Difference]: With dead ends: 3824 [2024-11-07 01:07:42,600 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 01:07:42,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:42,608 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5086 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5101 SdHoareTripleChecker+Valid, 21656 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:42,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5101 Valid, 21656 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:07:42,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 01:07:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2950. [2024-11-07 01:07:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2872 states have (on average 1.7816852367688023) internal successors, (5117), 2876 states have internal predecessors, (5117), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-07 01:07:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5234 transitions. [2024-11-07 01:07:42,720 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5234 transitions. Word has length 134 [2024-11-07 01:07:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:42,721 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 5234 transitions. [2024-11-07 01:07:42,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5234 transitions. [2024-11-07 01:07:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:42,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:42,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:42,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:07:42,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 629283882, now seen corresponding path program 1 times [2024-11-07 01:07:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746046866] [2024-11-07 01:07:42,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:42,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:42,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:42,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:42,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746046866] [2024-11-07 01:07:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746046866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:42,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:42,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088201415] [2024-11-07 01:07:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:42,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:42,940 INFO L87 Difference]: Start difference. First operand 2950 states and 5234 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:45,081 INFO L93 Difference]: Finished difference Result 4813 states and 8183 transitions. [2024-11-07 01:07:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:45,095 INFO L225 Difference]: With dead ends: 4813 [2024-11-07 01:07:45,095 INFO L226 Difference]: Without dead ends: 4000 [2024-11-07 01:07:45,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:45,099 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 5166 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 20993 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:45,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 20993 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:07:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2024-11-07 01:07:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3475. [2024-11-07 01:07:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3349 states have (on average 1.74499850701702) internal successors, (5844), 3355 states have internal predecessors, (5844), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-07 01:07:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 6037 transitions. [2024-11-07 01:07:45,180 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 6037 transitions. Word has length 134 [2024-11-07 01:07:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:45,181 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 6037 transitions. [2024-11-07 01:07:45,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 6037 transitions. [2024-11-07 01:07:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:45,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:45,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:45,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:07:45,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:45,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1938538452, now seen corresponding path program 1 times [2024-11-07 01:07:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:45,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773712589] [2024-11-07 01:07:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:45,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773712589] [2024-11-07 01:07:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773712589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:45,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:45,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758992638] [2024-11-07 01:07:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:45,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:45,380 INFO L87 Difference]: Start difference. First operand 3475 states and 6037 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:47,506 INFO L93 Difference]: Finished difference Result 6718 states and 11142 transitions. [2024-11-07 01:07:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:47,526 INFO L225 Difference]: With dead ends: 6718 [2024-11-07 01:07:47,526 INFO L226 Difference]: Without dead ends: 5380 [2024-11-07 01:07:47,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:47,532 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5084 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:47,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 21654 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:07:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2024-11-07 01:07:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4526. [2024-11-07 01:07:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 4304 states have (on average 1.695631970260223) internal successors, (7298), 4314 states have internal predecessors, (7298), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:07:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 7649 transitions. [2024-11-07 01:07:47,675 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 7649 transitions. Word has length 134 [2024-11-07 01:07:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:47,675 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 7649 transitions. [2024-11-07 01:07:47,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 7649 transitions. [2024-11-07 01:07:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:47,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:47,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:07:47,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1467182102, now seen corresponding path program 1 times [2024-11-07 01:07:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360351902] [2024-11-07 01:07:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360351902] [2024-11-07 01:07:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360351902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093533770] [2024-11-07 01:07:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:47,839 INFO L87 Difference]: Start difference. First operand 4526 states and 7649 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:49,963 INFO L93 Difference]: Finished difference Result 10520 states and 17064 transitions. [2024-11-07 01:07:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:49,994 INFO L225 Difference]: With dead ends: 10520 [2024-11-07 01:07:49,998 INFO L226 Difference]: Without dead ends: 8131 [2024-11-07 01:07:50,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:50,011 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5080 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:50,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 21654 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:07:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8131 states. [2024-11-07 01:07:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8131 to 6642. [2024-11-07 01:07:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6642 states, 6228 states have (on average 1.642581888246628) internal successors, (10230), 6246 states have internal predecessors, (10230), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-07 01:07:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6642 states to 6642 states and 10915 transitions. [2024-11-07 01:07:50,320 INFO L78 Accepts]: Start accepts. Automaton has 6642 states and 10915 transitions. Word has length 134 [2024-11-07 01:07:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:50,321 INFO L471 AbstractCegarLoop]: Abstraction has 6642 states and 10915 transitions. [2024-11-07 01:07:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6642 states and 10915 transitions. [2024-11-07 01:07:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:50,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:50,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] [2024-11-07 01:07:50,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:07:50,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:50,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash 696434472, now seen corresponding path program 1 times [2024-11-07 01:07:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:50,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224978215] [2024-11-07 01:07:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:50,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224978215] [2024-11-07 01:07:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224978215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424336027] [2024-11-07 01:07:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:50,500 INFO L87 Difference]: Start difference. First operand 6642 states and 10915 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:52,906 INFO L93 Difference]: Finished difference Result 18142 states and 29000 transitions. [2024-11-07 01:07:52,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:52,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:52,950 INFO L225 Difference]: With dead ends: 18142 [2024-11-07 01:07:52,950 INFO L226 Difference]: Without dead ends: 13637 [2024-11-07 01:07:52,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:52,964 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5079 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5094 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:52,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5094 Valid, 21654 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:07:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2024-11-07 01:07:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 10887. [2024-11-07 01:07:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5969868173258004) internal successors, (16112), 10123 states have internal predecessors, (16112), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 01:07:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17519 transitions. [2024-11-07 01:07:53,307 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17519 transitions. Word has length 134 [2024-11-07 01:07:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:53,308 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17519 transitions. [2024-11-07 01:07:53,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17519 transitions. [2024-11-07 01:07:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:53,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:53,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:53,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:07:53,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash -342150102, now seen corresponding path program 1 times [2024-11-07 01:07:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940876083] [2024-11-07 01:07:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:53,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:53,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940876083] [2024-11-07 01:07:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940876083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273536423] [2024-11-07 01:07:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:53,567 INFO L87 Difference]: Start difference. First operand 10887 states and 17519 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:54,886 INFO L93 Difference]: Finished difference Result 22528 states and 36089 transitions. [2024-11-07 01:07:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:07:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:54,926 INFO L225 Difference]: With dead ends: 22528 [2024-11-07 01:07:54,926 INFO L226 Difference]: Without dead ends: 13778 [2024-11-07 01:07:54,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:07:54,949 INFO L432 NwaCegarLoop]: 4185 mSDtfsCounter, 4780 mSDsluCounter, 16543 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 20728 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:54,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 20728 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:07:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2024-11-07 01:07:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 10887. [2024-11-07 01:07:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5937159282386757) internal successors, (16079), 10123 states have internal predecessors, (16079), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 01:07:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17486 transitions. [2024-11-07 01:07:55,331 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17486 transitions. Word has length 134 [2024-11-07 01:07:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:55,331 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17486 transitions. [2024-11-07 01:07:55,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17486 transitions. [2024-11-07 01:07:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:55,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:55,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:55,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:07:55,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1979651816, now seen corresponding path program 1 times [2024-11-07 01:07:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779939598] [2024-11-07 01:07:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779939598] [2024-11-07 01:07:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779939598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479629039] [2024-11-07 01:07:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:55,506 INFO L87 Difference]: Start difference. First operand 10887 states and 17486 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:58,464 INFO L93 Difference]: Finished difference Result 33351 states and 52830 transitions. [2024-11-07 01:07:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:58,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:07:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:58,638 INFO L225 Difference]: With dead ends: 33351 [2024-11-07 01:07:58,638 INFO L226 Difference]: Without dead ends: 24601 [2024-11-07 01:07:58,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:58,699 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5071 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5086 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:58,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5086 Valid, 21654 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:07:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24601 states. [2024-11-07 01:07:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24601 to 19441. [2024-11-07 01:07:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19441 states, 17875 states have (on average 1.5603356643356643) internal successors, (27891), 17941 states have internal predecessors, (27891), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 454 states have return successors, (1903), 1173 states have call predecessors, (1903), 1110 states have call successors, (1903) [2024-11-07 01:07:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19441 states to 19441 states and 30904 transitions. [2024-11-07 01:07:59,525 INFO L78 Accepts]: Start accepts. Automaton has 19441 states and 30904 transitions. Word has length 134 [2024-11-07 01:07:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:59,525 INFO L471 AbstractCegarLoop]: Abstraction has 19441 states and 30904 transitions. [2024-11-07 01:07:59,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 19441 states and 30904 transitions. [2024-11-07 01:07:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:07:59,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:59,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:59,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:07:59,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:59,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -162208662, now seen corresponding path program 1 times [2024-11-07 01:07:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970794388] [2024-11-07 01:07:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:07:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:07:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:07:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:07:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970794388] [2024-11-07 01:07:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970794388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866428750] [2024-11-07 01:07:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:59,698 INFO L87 Difference]: Start difference. First operand 19441 states and 30904 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:08:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:08:03,401 INFO L93 Difference]: Finished difference Result 71583 states and 113144 transitions. [2024-11-07 01:08:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:08:03,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:08:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:08:03,578 INFO L225 Difference]: With dead ends: 71583 [2024-11-07 01:08:03,579 INFO L226 Difference]: Without dead ends: 54279 [2024-11-07 01:08:03,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:08:03,628 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5400 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5424 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:08:03,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5424 Valid, 21644 Invalid, 2479 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:08:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54279 states. [2024-11-07 01:08:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54279 to 36418. [2024-11-07 01:08:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36418 states, 33380 states have (on average 1.5421509886159377) internal successors, (51477), 33510 states have internal predecessors, (51477), 2134 states have call successors, (2134), 774 states have call predecessors, (2134), 902 states have return successors, (4449), 2261 states have call predecessors, (4449), 2134 states have call successors, (4449) [2024-11-07 01:08:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36418 states to 36418 states and 58060 transitions. [2024-11-07 01:08:05,273 INFO L78 Accepts]: Start accepts. Automaton has 36418 states and 58060 transitions. Word has length 134 [2024-11-07 01:08:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:08:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 36418 states and 58060 transitions. [2024-11-07 01:08:05,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:08:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36418 states and 58060 transitions. [2024-11-07 01:08:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:08:05,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:08:05,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:08:05,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:08:05,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:08:05,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:08:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash -785490264, now seen corresponding path program 1 times [2024-11-07 01:08:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:08:05,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076091221] [2024-11-07 01:08:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:08:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:08:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:08:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:08:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:08:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:08:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:08:05,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:08:05,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076091221] [2024-11-07 01:08:05,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076091221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:08:05,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:08:05,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:08:05,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853272534] [2024-11-07 01:08:05,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:08:05,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:08:05,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:08:05,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:08:05,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:08:05,485 INFO L87 Difference]: Start difference. First operand 36418 states and 58060 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:08:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:08:11,782 INFO L93 Difference]: Finished difference Result 138190 states and 220638 transitions. [2024-11-07 01:08:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:08:11,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:08:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:08:12,106 INFO L225 Difference]: With dead ends: 138190 [2024-11-07 01:08:12,106 INFO L226 Difference]: Without dead ends: 103909 [2024-11-07 01:08:12,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:08:12,226 INFO L432 NwaCegarLoop]: 4236 mSDtfsCounter, 5209 mSDsluCounter, 16803 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21039 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:08:12,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21039 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:08:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103909 states. [2024-11-07 01:08:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103909 to 69667. [2024-11-07 01:08:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69667 states, 63749 states have (on average 1.532369135202121) internal successors, (97687), 64007 states have internal predecessors, (97687), 4118 states have call successors, (4118), 1542 states have call predecessors, (4118), 1798 states have return successors, (10935), 4373 states have call predecessors, (10935), 4118 states have call successors, (10935) [2024-11-07 01:08:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69667 states to 69667 states and 112740 transitions. [2024-11-07 01:08:15,990 INFO L78 Accepts]: Start accepts. Automaton has 69667 states and 112740 transitions. Word has length 134 [2024-11-07 01:08:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:08:15,991 INFO L471 AbstractCegarLoop]: Abstraction has 69667 states and 112740 transitions. [2024-11-07 01:08:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:08:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 69667 states and 112740 transitions. [2024-11-07 01:08:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:08:16,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:08:16,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:08:16,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:08:16,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:08:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:08:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -667048790, now seen corresponding path program 1 times [2024-11-07 01:08:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:08:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274716021] [2024-11-07 01:08:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:08:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:08:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:08:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:08:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:16,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:08:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:08:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:08:16,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:08:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274716021] [2024-11-07 01:08:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274716021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:08:16,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:08:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:08:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624343167] [2024-11-07 01:08:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:08:16,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:08:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:08:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:08:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:08:16,195 INFO L87 Difference]: Start difference. First operand 69667 states and 112740 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:08:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:08:25,689 INFO L93 Difference]: Finished difference Result 267117 states and 434484 transitions. [2024-11-07 01:08:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:08:25,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 134 [2024-11-07 01:08:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:08:26,709 INFO L225 Difference]: With dead ends: 267117 [2024-11-07 01:08:26,709 INFO L226 Difference]: Without dead ends: 199587 [2024-11-07 01:08:26,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:08:26,951 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5326 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5350 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:08:26,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5350 Valid, 21644 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:08:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199587 states. [2024-11-07 01:08:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199587 to 136676. [2024-11-07 01:08:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136676 states, 125126 states have (on average 1.5285152566213258) internal successors, (191257), 125640 states have internal predecessors, (191257), 7958 states have call successors, (7958), 3078 states have call predecessors, (7958), 3590 states have return successors, (28153), 8469 states have call predecessors, (28153), 7958 states have call successors, (28153) [2024-11-07 01:08:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136676 states to 136676 states and 227368 transitions. [2024-11-07 01:08:34,563 INFO L78 Accepts]: Start accepts. Automaton has 136676 states and 227368 transitions. Word has length 134 [2024-11-07 01:08:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:08:34,564 INFO L471 AbstractCegarLoop]: Abstraction has 136676 states and 227368 transitions. [2024-11-07 01:08:34,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:08:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 136676 states and 227368 transitions. [2024-11-07 01:08:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:08:34,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:08:34,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:08:34,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:08:34,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:08:34,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:08:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash 722245224, now seen corresponding path program 1 times [2024-11-07 01:08:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:08:34,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460061087] [2024-11-07 01:08:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:34,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:08:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:08:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:08:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:34,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:08:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:08:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:08:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:08:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:08:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460061087] [2024-11-07 01:08:34,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460061087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:08:34,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:08:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:08:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72391328] [2024-11-07 01:08:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:08:34,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:08:34,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:08:34,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:08:34,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:08:34,754 INFO L87 Difference]: Start difference. First operand 136676 states and 227368 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)