./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i --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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i', '-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', '9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289'] 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -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 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:18:26,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:18:26,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:18:26,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:18:26,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:18:26,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:18:26,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:18:26,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:18:26,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:18:26,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:18:26,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:18:26,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:18:26,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:18:26,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:18:26,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:18:26,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:18:26,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:18:26,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:18:26,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:18:26,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:18:26,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:18:26,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:18:26,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:18:26,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:18:26,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:18:26,804 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 -> 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 [2024-11-07 08:18:27,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:18:27,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:18:27,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:18:27,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:18:27,104 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:18:27,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-11-07 08:18:28,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:18:28,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:18:28,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-11-07 08:18:28,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ed0021dc/fe63a232353143ec81f6bb26a0f9c631/FLAG231c079c9 [2024-11-07 08:18:28,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ed0021dc/fe63a232353143ec81f6bb26a0f9c631 [2024-11-07 08:18:28,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:18:28,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:18:28,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:18:28,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:18:28,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:18:28,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:18:28" (1/1) ... [2024-11-07 08:18:28,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1103e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:28, skipping insertion in model container [2024-11-07 08:18:28,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:18:28" (1/1) ... [2024-11-07 08:18:28,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:18:28,994 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2024-11-07 08:18:29,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:18:29,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:18:29,084 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2024-11-07 08:18:29,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:18:29,134 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:18:29,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29 WrapperNode [2024-11-07 08:18:29,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:18:29,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:18:29,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:18:29,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:18:29,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,190 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-07 08:18:29,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:18:29,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:18:29,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:18:29,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:18:29,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,219 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 08:18:29,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:18:29,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:18:29,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:18:29,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:18:29,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (1/1) ... [2024-11-07 08:18:29,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:18:29,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:18:29,279 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 08:18:29,286 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 08:18:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:18:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:18:29,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:18:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:18:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:18:29,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:18:29,386 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:18:29,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:18:29,703 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 08:18:29,703 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:18:29,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:18:29,715 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:18:29,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:29 BoogieIcfgContainer [2024-11-07 08:18:29,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:18:29,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:18:29,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:18:29,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:18:29,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:18:28" (1/3) ... [2024-11-07 08:18:29,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333bbd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:18:29, skipping insertion in model container [2024-11-07 08:18:29,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:18:29" (2/3) ... [2024-11-07 08:18:29,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333bbd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:18:29, skipping insertion in model container [2024-11-07 08:18:29,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:29" (3/3) ... [2024-11-07 08:18:29,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-11-07 08:18:29,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:18:29,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:18:29,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:18:29,809 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;@7a18065b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:18:29,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:18:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 08:18:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 08:18:29,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:29,840 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:29,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:29,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1550587417, now seen corresponding path program 1 times [2024-11-07 08:18:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299260848] [2024-11-07 08:18:29,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:29,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299260848] [2024-11-07 08:18:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299260848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:18:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847209441] [2024-11-07 08:18:30,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:18:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:18:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:18:30,094 INFO L87 Difference]: Start difference. First operand has 49 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 08:18:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:30,112 INFO L93 Difference]: Finished difference Result 93 states and 140 transitions. [2024-11-07 08:18:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:18:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-07 08:18:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:30,120 INFO L225 Difference]: With dead ends: 93 [2024-11-07 08:18:30,120 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 08:18:30,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:18:30,127 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:30,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:18:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 08:18:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 08:18:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 08:18:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-07 08:18:30,166 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 58 [2024-11-07 08:18:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:30,166 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-07 08:18:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 08:18:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-07 08:18:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 08:18:30,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:30,170 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:30,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:18:30,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash -998114271, now seen corresponding path program 1 times [2024-11-07 08:18:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:30,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685316241] [2024-11-07 08:18:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685316241] [2024-11-07 08:18:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685316241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:18:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47527921] [2024-11-07 08:18:31,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:31,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:18:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:18:31,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:31,103 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:31,344 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2024-11-07 08:18:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:18:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2024-11-07 08:18:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:31,347 INFO L225 Difference]: With dead ends: 145 [2024-11-07 08:18:31,349 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 08:18:31,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:18:31,351 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 91 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:31,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 191 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:18:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 08:18:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2024-11-07 08:18:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 08:18:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2024-11-07 08:18:31,379 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 58 [2024-11-07 08:18:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:31,379 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2024-11-07 08:18:31,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2024-11-07 08:18:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 08:18:31,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:31,383 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:31,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:18:31,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:31,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -359529112, now seen corresponding path program 1 times [2024-11-07 08:18:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539500933] [2024-11-07 08:18:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:31,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539500933] [2024-11-07 08:18:31,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539500933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:31,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:31,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:18:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399271005] [2024-11-07 08:18:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:31,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:18:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:31,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:18:31,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:31,938 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:32,257 INFO L93 Difference]: Finished difference Result 218 states and 287 transitions. [2024-11-07 08:18:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:18:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-07 08:18:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:32,260 INFO L225 Difference]: With dead ends: 218 [2024-11-07 08:18:32,260 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 08:18:32,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:18:32,262 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:32,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 230 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:18:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 08:18:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2024-11-07 08:18:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:18:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2024-11-07 08:18:32,304 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 59 [2024-11-07 08:18:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:32,304 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2024-11-07 08:18:32,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2024-11-07 08:18:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 08:18:32,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:32,305 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:18:32,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:32,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -946335126, now seen corresponding path program 1 times [2024-11-07 08:18:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864369490] [2024-11-07 08:18:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864369490] [2024-11-07 08:18:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864369490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:18:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953588242] [2024-11-07 08:18:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:18:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:18:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:18:32,393 INFO L87 Difference]: Start difference. First operand 119 states and 161 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:32,419 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2024-11-07 08:18:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:18:32,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-07 08:18:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:32,421 INFO L225 Difference]: With dead ends: 190 [2024-11-07 08:18:32,421 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 08:18:32,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:18:32,422 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:32,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:18:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 08:18:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-07 08:18:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:18:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2024-11-07 08:18:32,454 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 59 [2024-11-07 08:18:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:32,457 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2024-11-07 08:18:32,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2024-11-07 08:18:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 08:18:32,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:32,458 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:32,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:18:32,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:32,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash -557374028, now seen corresponding path program 1 times [2024-11-07 08:18:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:32,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930297220] [2024-11-07 08:18:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930297220] [2024-11-07 08:18:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930297220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:32,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:18:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225105475] [2024-11-07 08:18:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:32,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:18:32,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:18:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:18:32,805 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:32,934 INFO L93 Difference]: Finished difference Result 281 states and 375 transitions. [2024-11-07 08:18:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:18:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-07 08:18:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:32,938 INFO L225 Difference]: With dead ends: 281 [2024-11-07 08:18:32,938 INFO L226 Difference]: Without dead ends: 180 [2024-11-07 08:18:32,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:32,940 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:32,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:18:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-07 08:18:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2024-11-07 08:18:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:18:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2024-11-07 08:18:32,968 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 59 [2024-11-07 08:18:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:32,968 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2024-11-07 08:18:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2024-11-07 08:18:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 08:18:32,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:32,974 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:32,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:18:32,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:32,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2058896717, now seen corresponding path program 1 times [2024-11-07 08:18:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946903890] [2024-11-07 08:18:32,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:34,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946903890] [2024-11-07 08:18:34,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946903890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:34,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:34,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:18:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303520651] [2024-11-07 08:18:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:34,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:18:34,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:18:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:18:34,333 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:34,615 INFO L93 Difference]: Finished difference Result 349 states and 460 transitions. [2024-11-07 08:18:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:18:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-07 08:18:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:34,617 INFO L225 Difference]: With dead ends: 349 [2024-11-07 08:18:34,617 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 08:18:34,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:18:34,620 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 197 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:34,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 267 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:18:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 08:18:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 114. [2024-11-07 08:18:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:18:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2024-11-07 08:18:34,653 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 60 [2024-11-07 08:18:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:34,654 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2024-11-07 08:18:34,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2024-11-07 08:18:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 08:18:34,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:34,658 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:34,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:18:34,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:34,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:34,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2034785575, now seen corresponding path program 1 times [2024-11-07 08:18:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363952203] [2024-11-07 08:18:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:34,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363952203] [2024-11-07 08:18:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363952203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:34,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:18:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724689323] [2024-11-07 08:18:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:18:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:18:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:18:34,744 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:34,795 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2024-11-07 08:18:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:18:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-07 08:18:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:34,797 INFO L225 Difference]: With dead ends: 204 [2024-11-07 08:18:34,797 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 08:18:34,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:18:34,798 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:34,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:18:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 08:18:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2024-11-07 08:18:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:18:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2024-11-07 08:18:34,815 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 60 [2024-11-07 08:18:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:34,816 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2024-11-07 08:18:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2024-11-07 08:18:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 08:18:34,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:34,817 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:34,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:18:34,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:34,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1333720997, now seen corresponding path program 1 times [2024-11-07 08:18:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:34,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709429403] [2024-11-07 08:18:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:34,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709429403] [2024-11-07 08:18:34,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709429403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:34,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:34,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:18:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674784405] [2024-11-07 08:18:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:18:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:34,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:18:34,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:18:34,895 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:34,945 INFO L93 Difference]: Finished difference Result 184 states and 239 transitions. [2024-11-07 08:18:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:18:34,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-07 08:18:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:34,947 INFO L225 Difference]: With dead ends: 184 [2024-11-07 08:18:34,947 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 08:18:34,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:18:34,948 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:34,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 96 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:18:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 08:18:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2024-11-07 08:18:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:18:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2024-11-07 08:18:34,963 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 60 [2024-11-07 08:18:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:34,963 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2024-11-07 08:18:34,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2024-11-07 08:18:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 08:18:34,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:34,965 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:34,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:18:34,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:34,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1284924752, now seen corresponding path program 1 times [2024-11-07 08:18:34,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:34,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074206355] [2024-11-07 08:18:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074206355] [2024-11-07 08:18:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074206355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:35,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:18:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244869010] [2024-11-07 08:18:35,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:35,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:18:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:18:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:18:35,758 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:35,951 INFO L93 Difference]: Finished difference Result 259 states and 333 transitions. [2024-11-07 08:18:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:18:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-07 08:18:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:35,954 INFO L225 Difference]: With dead ends: 259 [2024-11-07 08:18:35,954 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 08:18:35,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:18:35,955 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:35,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 158 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:18:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 08:18:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2024-11-07 08:18:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.170940170940171) internal successors, (137), 117 states have internal predecessors, (137), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:18:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2024-11-07 08:18:35,980 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 61 [2024-11-07 08:18:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:35,981 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2024-11-07 08:18:35,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2024-11-07 08:18:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 08:18:35,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:35,984 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:18:35,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1703304963, now seen corresponding path program 1 times [2024-11-07 08:18:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815335267] [2024-11-07 08:18:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815335267] [2024-11-07 08:18:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815335267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:18:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746507462] [2024-11-07 08:18:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:36,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:18:36,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:18:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:18:36,822 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:37,692 INFO L93 Difference]: Finished difference Result 246 states and 310 transitions. [2024-11-07 08:18:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:18:37,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2024-11-07 08:18:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:37,695 INFO L225 Difference]: With dead ends: 246 [2024-11-07 08:18:37,695 INFO L226 Difference]: Without dead ends: 244 [2024-11-07 08:18:37,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-11-07 08:18:37,696 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 240 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:37,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 465 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:18:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-07 08:18:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 166. [2024-11-07 08:18:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 133 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:18:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-11-07 08:18:37,718 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 63 [2024-11-07 08:18:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-11-07 08:18:37,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-11-07 08:18:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 08:18:37,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:37,719 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:37,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 08:18:37,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:37,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -905581888, now seen corresponding path program 1 times [2024-11-07 08:18:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336169838] [2024-11-07 08:18:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:18:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336169838] [2024-11-07 08:18:38,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336169838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:38,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:18:38,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:18:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124216891] [2024-11-07 08:18:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:18:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:18:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:18:38,276 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:38,541 INFO L93 Difference]: Finished difference Result 175 states and 220 transitions. [2024-11-07 08:18:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:18:38,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2024-11-07 08:18:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:38,543 INFO L225 Difference]: With dead ends: 175 [2024-11-07 08:18:38,543 INFO L226 Difference]: Without dead ends: 173 [2024-11-07 08:18:38,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:18:38,544 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 47 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:38,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 441 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:18:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-07 08:18:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2024-11-07 08:18:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 133 states have internal predecessors, (154), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:18:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2024-11-07 08:18:38,560 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 64 [2024-11-07 08:18:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:38,561 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2024-11-07 08:18:38,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:18:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2024-11-07 08:18:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:18:38,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:18:38,562 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:18:38,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 08:18:38,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:18:38,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:18:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash 134997047, now seen corresponding path program 1 times [2024-11-07 08:18:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:18:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21887030] [2024-11-07 08:18:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:18:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:18:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:18:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:18:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:18:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:18:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:18:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:18:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:18:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:18:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:18:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:18:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:18:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:18:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:18:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:18:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:18:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21887030] [2024-11-07 08:18:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21887030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:18:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065794955] [2024-11-07 08:18:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:18:38,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:18:38,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:18:38,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:18:38,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:18:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:18:38,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 08:18:38,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:18:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-07 08:18:38,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:18:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065794955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:18:38,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:18:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-07 08:18:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729662011] [2024-11-07 08:18:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:18:38,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:18:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:18:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:18:38,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:38,918 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 08:18:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:18:38,958 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2024-11-07 08:18:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:18:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 08:18:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:18:38,959 INFO L225 Difference]: With dead ends: 203 [2024-11-07 08:18:38,959 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:18:38,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:18:38,960 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:18:38,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:18:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:18:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:18:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 08:18:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:18:38,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2024-11-07 08:18:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:18:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:18:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 08:18:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:18:38,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:18:38,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:18:38,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:18:39,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 08:18:39,173 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:18:39,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:18:39,744 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:18:39,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:18:39 BoogieIcfgContainer [2024-11-07 08:18:39,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:18:39,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:18:39,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:18:39,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:18:39,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:18:29" (3/4) ... [2024-11-07 08:18:39,769 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:18:39,774 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:18:39,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 08:18:39,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:18:39,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:18:39,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:18:39,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:18:39,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:18:39,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:18:39,868 INFO L158 Benchmark]: Toolchain (without parser) took 11063.02ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 77.3MB in the beginning and 120.8MB in the end (delta: -43.6MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2024-11-07 08:18:39,868 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:18:39,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.73ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:39,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:39,870 INFO L158 Benchmark]: Boogie Preprocessor took 42.71ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 59.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:18:39,870 INFO L158 Benchmark]: RCFGBuilder took 479.43ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 44.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:18:39,870 INFO L158 Benchmark]: TraceAbstraction took 10047.71ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 44.4MB in the beginning and 125.1MB in the end (delta: -80.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-07 08:18:39,870 INFO L158 Benchmark]: Witness Printer took 100.30ms. Allocated memory is still 226.5MB. Free memory was 125.1MB in the beginning and 120.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:18:39,874 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.73ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.71ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 59.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 479.43ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 44.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10047.71ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 44.4MB in the beginning and 125.1MB in the end (delta: -80.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 100.30ms. Allocated memory is still 226.5MB. Free memory was 125.1MB in the beginning and 120.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 2363 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1611 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 752 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 436 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 886 ConstructedInterpolants, 0 QuantifiedInterpolants, 3673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1703/1704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((0 <= 0) && (var_1_4 == 0)) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && (last_1_var_1_11 <= 8)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || (((((1 <= k_loop) && (var_1_5 == var_1_11)) && (var_1_1 == last_1_var_1_5)) && (256 == var_1_5)) && (256 == last_1_var_1_5))) || (((((((65531 == (((long long) 65520 + last_1_var_1_11) % 65536)) || (last_1_var_1_11 != last_1_var_1_5)) && (var_1_4 == 0)) && (1 <= k_loop)) && (((long long) 5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && (((var_1_6 == (var_1_5 + 8)) && ((last_1_var_1_5 + 8) <= var_1_6)) || ((var_1_6 <= (7 + last_1_var_1_5)) && (last_1_var_1_5 == var_1_5))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((((0 <= 0) && ((5 + var_1_1) == 0)) && (last_1_var_1_11 <= 8)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) Ensures: (((((((0 <= 0) && ((5 + var_1_1) == 0)) && (last_1_var_1_11 <= 8)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:18:39,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE