./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-1.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_100-while_file-1.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', 'ecbd2e76b09c20f709f57c97db51ca614252d67d1b8bd7f07a2fbe2befdf8756'] 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_100-while_file-1.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 ecbd2e76b09c20f709f57c97db51ca614252d67d1b8bd7f07a2fbe2befdf8756 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:05:55,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:05:55,278 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:05:55,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:05:55,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:05:55,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:05:55,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:05:55,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:05:55,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:05:55,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:05:55,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:05:55,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:05:55,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:05:55,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:05:55,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:05:55,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:05:55,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:05:55,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:05:55,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:05:55,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:05:55,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:05:55,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:05:55,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:05:55,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:05:55,326 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 -> ecbd2e76b09c20f709f57c97db51ca614252d67d1b8bd7f07a2fbe2befdf8756 [2024-11-07 08:05:55,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:05:55,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:05:55,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:05:55,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:05:55,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:05:55,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-1.i [2024-11-07 08:05:57,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:05:57,343 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:05:57,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-1.i [2024-11-07 08:05:57,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3cc9b7f0/564e5d7c7a734f34adba1171dfe23b7a/FLAG61777b43a [2024-11-07 08:05:57,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3cc9b7f0/564e5d7c7a734f34adba1171dfe23b7a [2024-11-07 08:05:57,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:05:57,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:05:57,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:05:57,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:05:57,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:05:57,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626bd3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57, skipping insertion in model container [2024-11-07 08:05:57,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:05:57,566 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_100-while_file-1.i[915,928] [2024-11-07 08:05:57,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:05:57,687 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:05:57,700 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_100-while_file-1.i[915,928] [2024-11-07 08:05:57,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:05:57,761 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:05:57,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57 WrapperNode [2024-11-07 08:05:57,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:05:57,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:05:57,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:05:57,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:05:57,768 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:05:57" (1/1) ... [2024-11-07 08:05:57,778 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:05:57" (1/1) ... [2024-11-07 08:05:57,824 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-11-07 08:05:57,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:05:57,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:05:57,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:05:57,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:05:57,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,876 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:05:57,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:05:57,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:05:57,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:05:57,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:05:57,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (1/1) ... [2024-11-07 08:05:57,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:05:57,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:05:57,949 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:05:57,954 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:05:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:05:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:05:57,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:05:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:05:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:05:57,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:05:58,065 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:05:58,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:05:58,721 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-07 08:05:58,721 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:05:58,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:05:58,735 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:05:58,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:05:58 BoogieIcfgContainer [2024-11-07 08:05:58,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:05:58,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:05:58,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:05:58,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:05:58,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:05:57" (1/3) ... [2024-11-07 08:05:58,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1beed276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:05:58, skipping insertion in model container [2024-11-07 08:05:58,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:57" (2/3) ... [2024-11-07 08:05:58,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1beed276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:05:58, skipping insertion in model container [2024-11-07 08:05:58,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:05:58" (3/3) ... [2024-11-07 08:05:58,745 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-1.i [2024-11-07 08:05:58,759 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:05:58,760 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:05:58,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:05:58,823 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;@59ade026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:05:58,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:05:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 08:05:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 08:05:58,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:05:58,846 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:58,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:05:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:05:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1412415497, now seen corresponding path program 1 times [2024-11-07 08:05:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:05:58,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70086398] [2024-11-07 08:05:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:05:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:05:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:05:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:05:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:05:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:05:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:05:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:05:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:05:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:05:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:05:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:05:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:05:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 08:05:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:05:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:05:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:05:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:05:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:05:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:05:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:05:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:05:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:05:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:05:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:05:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:05:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:05:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:05:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:05:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:05:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:05:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:06:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:06:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:00,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:06:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:00,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:06:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 08:06:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 08:06:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:06:00,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70086398] [2024-11-07 08:06:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70086398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:06:00,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:06:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:06:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456658048] [2024-11-07 08:06:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:06:00,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:06:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:06:00,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:06:00,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:06:00,108 INFO L87 Difference]: Start difference. First operand has 116 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 08:06:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:06:00,235 INFO L93 Difference]: Finished difference Result 334 states and 603 transitions. [2024-11-07 08:06:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:06:00,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-07 08:06:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:06:00,254 INFO L225 Difference]: With dead ends: 334 [2024-11-07 08:06:00,254 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 08:06:00,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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:06:00,271 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 105 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 512 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:06:00,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 512 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:06:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 08:06:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2024-11-07 08:06:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.4333333333333333) internal successors, (215), 150 states have internal predecessors, (215), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 08:06:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 347 transitions. [2024-11-07 08:06:00,358 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 347 transitions. Word has length 213 [2024-11-07 08:06:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:06:00,361 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 347 transitions. [2024-11-07 08:06:00,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 08:06:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 347 transitions. [2024-11-07 08:06:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 08:06:00,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:06:00,370 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:00,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:06:00,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:06:00,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:06:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1721932938, now seen corresponding path program 1 times [2024-11-07 08:06:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:06:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150243319] [2024-11-07 08:06:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:06:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:06:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:06:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:06:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:06:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:06:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:06:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:06:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:06:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:06:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:06:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:06:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:06:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 08:06:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:06:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:06:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:06:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:06:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:06:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:06:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:06:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:06:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:06:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:06:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:06:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:06:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:06:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:06:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:06:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:06:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:06:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:06:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:06:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:06:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 08:06:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 08:06:01,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:06:01,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150243319] [2024-11-07 08:06:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150243319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:06:01,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:06:01,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:06:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379399747] [2024-11-07 08:06:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:06:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:06:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:06:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:06:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:06:01,820 INFO L87 Difference]: Start difference. First operand 219 states and 347 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 08:06:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:06:02,183 INFO L93 Difference]: Finished difference Result 547 states and 860 transitions. [2024-11-07 08:06:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:06:02,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-07 08:06:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:06:02,190 INFO L225 Difference]: With dead ends: 547 [2024-11-07 08:06:02,192 INFO L226 Difference]: Without dead ends: 331 [2024-11-07 08:06:02,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:06:02,195 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 82 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:06:02,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 472 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:06:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-07 08:06:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2024-11-07 08:06:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 234 states have (on average 1.4316239316239316) internal successors, (335), 236 states have internal predecessors, (335), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:06:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 511 transitions. [2024-11-07 08:06:02,288 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 511 transitions. Word has length 214 [2024-11-07 08:06:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:06:02,290 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 511 transitions. [2024-11-07 08:06:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 08:06:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 511 transitions. [2024-11-07 08:06:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 08:06:02,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:06:02,296 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:02,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:06:02,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:06:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:06:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2114959948, now seen corresponding path program 1 times [2024-11-07 08:06:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:06:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412620886] [2024-11-07 08:06:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:06:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:06:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:06:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:06:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:06:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:06:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:06:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:06:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:06:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:06:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:06:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:06:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:06:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 08:06:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:06:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:06:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:06:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:06:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:06:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:06:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:06:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 08:06:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 08:06:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:06:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 08:06:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:06:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 08:06:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 08:06:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 08:06:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 08:06:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 08:06:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 08:06:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 08:06:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 08:06:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 08:06:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 261 proven. 225 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-07 08:06:13,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:06:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412620886] [2024-11-07 08:06:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412620886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:06:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873075332] [2024-11-07 08:06:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:06:13,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:06:13,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:06:13,143 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:06:13,144 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:06:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:06:13,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-07 08:06:13,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:06:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1563 proven. 243 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-07 08:06:21,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:06:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873075332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:06:35,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:06:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 41 [2024-11-07 08:06:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063676890] [2024-11-07 08:06:35,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:06:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-07 08:06:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:06:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-07 08:06:35,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2153, Unknown=7, NotChecked=0, Total=2450 [2024-11-07 08:06:35,558 INFO L87 Difference]: Start difference. First operand 327 states and 511 transitions. Second operand has 41 states, 40 states have (on average 3.225) internal successors, (129), 39 states have internal predecessors, (129), 17 states have call successors, (66), 8 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 17 states have call successors, (66) [2024-11-07 08:06:43,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 08:06:58,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 08:07:07,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 08:07:11,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 08:07:20,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 08:07:24,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]