./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c'] 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/floats-nonlinear/bound-unconstrained.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:17:47,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:17:47,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:17:47,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:17:47,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:17:47,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:17:47,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:17:47,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:17:47,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:17:47,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:17:47,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:17:47,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:17:47,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:17:47,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:17:47,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:17:47,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:17:47,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:17:47,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:17:47,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:17:47,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:17:47,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:17:47,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:17:47,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:17:47,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:17:47,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:17:47,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:17:47,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:17:47,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:17:47,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:17:47,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:17:47,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:17:47,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:17:47,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:17:47,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:17:47,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:17:47,419 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 -> d0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c [2024-11-06 22:17:47,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:17:47,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:17:47,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:17:47,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:17:47,701 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:17:47,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2024-11-06 22:17:48,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:17:49,158 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:17:49,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2024-11-06 22:17:49,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66feae17a/e2774307700a43839c0711614ec944ea/FLAG90bbb647d [2024-11-06 22:17:49,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66feae17a/e2774307700a43839c0711614ec944ea [2024-11-06 22:17:49,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:17:49,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:17:49,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:17:49,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:17:49,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:17:49,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fce0778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49, skipping insertion in model container [2024-11-06 22:17:49,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:17:49,677 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/floats-nonlinear/bound-unconstrained.c[614,627] [2024-11-06 22:17:49,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:17:49,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:17:49,723 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/floats-nonlinear/bound-unconstrained.c[614,627] [2024-11-06 22:17:49,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:17:49,750 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:17:49,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49 WrapperNode [2024-11-06 22:17:49,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:17:49,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:17:49,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:17:49,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:17:49,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,787 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-06 22:17:49,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:17:49,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:17:49,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:17:49,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:17:49,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,822 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-06 22:17:49,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:17:49,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:17:49,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:17:49,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:17:49,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (1/1) ... [2024-11-06 22:17:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:17:49,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:17:49,876 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-06 22:17:49,883 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-06 22:17:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:17:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:17:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:17:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:17:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-06 22:17:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-06 22:17:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:17:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:17:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:17:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:17:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:17:49,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:17:49,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:17:50,151 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-06 22:17:50,151 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:17:50,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:17:50,161 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 22:17:50,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:50 BoogieIcfgContainer [2024-11-06 22:17:50,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:17:50,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:17:50,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:17:50,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:17:50,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:49" (1/3) ... [2024-11-06 22:17:50,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbb5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:50, skipping insertion in model container [2024-11-06 22:17:50,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:49" (2/3) ... [2024-11-06 22:17:50,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbb5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:50, skipping insertion in model container [2024-11-06 22:17:50,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:50" (3/3) ... [2024-11-06 22:17:50,172 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-unconstrained.c [2024-11-06 22:17:50,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:17:50,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:17:50,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:17:50,237 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;@1bee74a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:17:50,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:17:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:17:50,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:50,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:50,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:50,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 759900455, now seen corresponding path program 1 times [2024-11-06 22:17:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:50,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135624630] [2024-11-06 22:17:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:17:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135624630] [2024-11-06 22:17:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135624630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:17:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653109081] [2024-11-06 22:17:50,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:50,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:17:50,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:17:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:17:50,578 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:50,636 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-11-06 22:17:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:17:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-06 22:17:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:50,644 INFO L225 Difference]: With dead ends: 73 [2024-11-06 22:17:50,644 INFO L226 Difference]: Without dead ends: 38 [2024-11-06 22:17:50,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:17:50,648 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:50,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-06 22:17:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-06 22:17:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:17:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-11-06 22:17:50,684 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 19 [2024-11-06 22:17:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:50,685 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-11-06 22:17:50,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-06 22:17:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:17:50,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:50,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:17:50,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2027515032, now seen corresponding path program 1 times [2024-11-06 22:17:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166076644] [2024-11-06 22:17:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:17:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166076644] [2024-11-06 22:17:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166076644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:17:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021399244] [2024-11-06 22:17:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:17:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:17:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:17:50,753 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:50,778 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-06 22:17:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:17:50,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-06 22:17:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:50,782 INFO L225 Difference]: With dead ends: 43 [2024-11-06 22:17:50,783 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:17:50,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:17:50,784 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:50,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:17:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:17:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:17:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-06 22:17:50,795 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 19 [2024-11-06 22:17:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:50,795 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-06 22:17:50,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-06 22:17:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:17:50,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:50,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:50,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:17:50,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2027455450, now seen corresponding path program 1 times [2024-11-06 22:17:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:50,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665542338] [2024-11-06 22:17:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:17:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665542338] [2024-11-06 22:17:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665542338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:50,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:17:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717689007] [2024-11-06 22:17:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:50,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:17:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:17:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:50,900 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:50,912 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-11-06 22:17:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:17:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-06 22:17:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:50,914 INFO L225 Difference]: With dead ends: 43 [2024-11-06 22:17:50,915 INFO L226 Difference]: Without dead ends: 38 [2024-11-06 22:17:50,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:50,916 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:50,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-06 22:17:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-06 22:17:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:17:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-06 22:17:50,926 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 19 [2024-11-06 22:17:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:50,926 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-06 22:17:50,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-06 22:17:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 22:17:50,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:50,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:50,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:17:50,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:50,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1306662713, now seen corresponding path program 1 times [2024-11-06 22:17:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298854864] [2024-11-06 22:17:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:17:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298854864] [2024-11-06 22:17:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298854864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:17:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095597439] [2024-11-06 22:17:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:17:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:51,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:17:51,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:17:51,039 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:51,057 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-11-06 22:17:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:17:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-06 22:17:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:51,061 INFO L225 Difference]: With dead ends: 52 [2024-11-06 22:17:51,062 INFO L226 Difference]: Without dead ends: 45 [2024-11-06 22:17:51,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:17:51,063 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:51,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-06 22:17:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-06 22:17:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:17:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-06 22:17:51,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 22 [2024-11-06 22:17:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-06 22:17:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-06 22:17:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 22:17:51,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:51,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 22:17:51,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1623898437, now seen corresponding path program 1 times [2024-11-06 22:17:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839401548] [2024-11-06 22:17:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:17:51,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839401548] [2024-11-06 22:17:51,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839401548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:51,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:51,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:17:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930331459] [2024-11-06 22:17:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:51,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:17:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:17:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,146 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:51,177 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-11-06 22:17:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:17:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-06 22:17:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:51,179 INFO L225 Difference]: With dead ends: 55 [2024-11-06 22:17:51,179 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:17:51,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,180 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:51,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:17:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:17:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:17:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-11-06 22:17:51,190 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 23 [2024-11-06 22:17:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:51,191 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-11-06 22:17:51,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-11-06 22:17:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-06 22:17:51,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:51,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 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-06 22:17:51,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:17:51,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:51,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1586179963, now seen corresponding path program 1 times [2024-11-06 22:17:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711699886] [2024-11-06 22:17:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-06 22:17:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:17:51,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711699886] [2024-11-06 22:17:51,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711699886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:51,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:17:51,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461554972] [2024-11-06 22:17:51,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:51,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:17:51,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:51,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:17:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,264 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:17:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:51,285 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-06 22:17:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:17:51,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-06 22:17:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:51,286 INFO L225 Difference]: With dead ends: 65 [2024-11-06 22:17:51,287 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:17:51,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,288 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:51,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:17:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:17:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:17:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-06 22:17:51,294 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 29 [2024-11-06 22:17:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:51,294 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-06 22:17:51,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:17:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-06 22:17:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 22:17:51,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:51,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 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-06 22:17:51,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:17:51,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash 354834250, now seen corresponding path program 1 times [2024-11-06 22:17:51,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:51,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975427910] [2024-11-06 22:17:51,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 22:17:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:17:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 22:17:51,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975427910] [2024-11-06 22:17:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975427910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:51,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:17:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262032881] [2024-11-06 22:17:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:17:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:17:51,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,361 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:17:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:51,395 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-06 22:17:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:17:51,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-06 22:17:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:51,396 INFO L225 Difference]: With dead ends: 69 [2024-11-06 22:17:51,396 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:17:51,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,397 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:51,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:17:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-06 22:17:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-06 22:17:51,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 35 [2024-11-06 22:17:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:51,404 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-06 22:17:51,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:17:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-06 22:17:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 22:17:51,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:51,405 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 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-06 22:17:51,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 22:17:51,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:51,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 193177993, now seen corresponding path program 1 times [2024-11-06 22:17:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:51,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408662920] [2024-11-06 22:17:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:17:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:17:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:17:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:17:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408662920] [2024-11-06 22:17:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408662920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:17:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483402308] [2024-11-06 22:17:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:17:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:51,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:17:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,525 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:51,545 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-06 22:17:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:17:51,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-06 22:17:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:51,546 INFO L225 Difference]: With dead ends: 41 [2024-11-06 22:17:51,546 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 22:17:51,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,547 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:51,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 22:17:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-06 22:17:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-06 22:17:51,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 41 [2024-11-06 22:17:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:51,552 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-06 22:17:51,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-06 22:17:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 22:17:51,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:51,557 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:17:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 22:17:51,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:51,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash -397851069, now seen corresponding path program 1 times [2024-11-06 22:17:51,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:51,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816914383] [2024-11-06 22:17:51,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:17:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:17:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:17:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:17:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816914383] [2024-11-06 22:17:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816914383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:51,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:17:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403838234] [2024-11-06 22:17:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:51,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:17:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:17:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:17:51,640 INFO L87 Difference]: Start difference. First operand 35 states and 40 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:51,681 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-06 22:17:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:17:51,681 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-06 22:17:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:51,682 INFO L225 Difference]: With dead ends: 56 [2024-11-06 22:17:51,682 INFO L226 Difference]: Without dead ends: 43 [2024-11-06 22:17:51,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-06 22:17:51,683 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:51,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-06 22:17:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-06 22:17:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-06 22:17:51,686 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 44 [2024-11-06 22:17:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:51,687 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-06 22:17:51,687 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-06 22:17:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 22:17:51,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:51,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:17:51,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 22:17:51,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:51,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 21171379, now seen corresponding path program 1 times [2024-11-06 22:17:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:51,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045165014] [2024-11-06 22:17:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:17:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:17:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:17:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:17:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045165014] [2024-11-06 22:17:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045165014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:17:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122376455] [2024-11-06 22:17:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:51,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:17:51,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:17:51,766 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-06 22:17:51,767 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-06 22:17:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:51,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 22:17:51,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:17:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:17:51,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:17:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:17:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122376455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:17:52,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:17:52,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-06 22:17:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112098353] [2024-11-06 22:17:52,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:17:52,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 22:17:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 22:17:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:17:52,007 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:52,127 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-11-06 22:17:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 22:17:52,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-11-06 22:17:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:52,128 INFO L225 Difference]: With dead ends: 74 [2024-11-06 22:17:52,128 INFO L226 Difference]: Without dead ends: 61 [2024-11-06 22:17:52,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:17:52,129 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:52,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 224 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:17:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-06 22:17:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-06 22:17:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-06 22:17:52,137 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 47 [2024-11-06 22:17:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:52,138 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-06 22:17:52,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-06 22:17:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 22:17:52,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:52,139 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 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-06 22:17:52,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 22:17:52,340 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,SelfDestructingSolverStorable9 [2024-11-06 22:17:52,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:52,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 102156763, now seen corresponding path program 2 times [2024-11-06 22:17:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596238245] [2024-11-06 22:17:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:17:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:17:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:52,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:17:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 22:17:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596238245] [2024-11-06 22:17:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596238245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:17:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844890715] [2024-11-06 22:17:52,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:17:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:17:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:17:52,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:17:52,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:17:52,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:17:52,587 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:17:52,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 22:17:52,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:17:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 22:17:52,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:17:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 22:17:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844890715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:17:52,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:17:52,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 9 [2024-11-06 22:17:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071894621] [2024-11-06 22:17:52,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:17:52,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 22:17:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 22:17:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:17:52,772 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:52,884 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-06 22:17:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 22:17:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-06 22:17:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:52,885 INFO L225 Difference]: With dead ends: 88 [2024-11-06 22:17:52,887 INFO L226 Difference]: Without dead ends: 74 [2024-11-06 22:17:52,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 131 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-11-06 22:17:52,888 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:52,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-06 22:17:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-06 22:17:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-11-06 22:17:52,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 66 [2024-11-06 22:17:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:52,896 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-06 22:17:52,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-11-06 22:17:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-06 22:17:52,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:52,897 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 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-06 22:17:52,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:17:53,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:17:53,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash 413434803, now seen corresponding path program 3 times [2024-11-06 22:17:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:53,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178775703] [2024-11-06 22:17:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:17:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:17:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:17:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-06 22:17:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178775703] [2024-11-06 22:17:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178775703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:17:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670755843] [2024-11-06 22:17:53,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 22:17:53,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:17:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:17:53,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:17:53,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:17:53,335 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-06 22:17:53,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:17:53,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:17:53,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:17:53,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:17:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-06 22:17:53,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:17:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670755843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:53,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:17:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-06 22:17:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971381681] [2024-11-06 22:17:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:17:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:17:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:17:53,413 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:53,434 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-06 22:17:53,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:17:53,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2024-11-06 22:17:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:53,435 INFO L225 Difference]: With dead ends: 68 [2024-11-06 22:17:53,435 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 22:17:53,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:17:53,436 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:53,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 22:17:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 22:17:53,437 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-06 22:17:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 22:17:53,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-11-06 22:17:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:17:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 22:17:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:17:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 22:17:53,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 22:17:53,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:17:53,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:17:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:17:53,644 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:53,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 22:17:53,669 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:17:53,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2024-11-06 22:17:53,680 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2024-11-06 22:17:53,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:53 BoogieIcfgContainer [2024-11-06 22:17:53,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:17:53,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:17:53,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:17:53,686 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:17:53,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:50" (3/4) ... [2024-11-06 22:17:53,688 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 22:17:53,692 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check_domain [2024-11-06 22:17:53,696 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-06 22:17:53,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-06 22:17:53,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-06 22:17:53,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 22:17:53,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 22:17:53,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 22:17:53,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:17:53,774 INFO L158 Benchmark]: Toolchain (without parser) took 4237.53ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.9MB in the beginning and 83.9MB in the end (delta: -6.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-06 22:17:53,775 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:17:53,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.55ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 65.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:17:53,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.00ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 63.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:17:53,776 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 62.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:17:53,777 INFO L158 Benchmark]: RCFGBuilder took 317.46ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 48.5MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:17:53,777 INFO L158 Benchmark]: TraceAbstraction took 3521.57ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 47.9MB in the beginning and 89.5MB in the end (delta: -41.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:17:53,778 INFO L158 Benchmark]: Witness Printer took 88.17ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 83.9MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:17:53,779 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.18ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.55ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 65.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.00ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 63.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 62.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 317.46ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 48.5MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3521.57ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 47.9MB in the beginning and 89.5MB in the end (delta: -41.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 88.17ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 83.9MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset * 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: 20]: 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 960 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 467 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 367 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 635 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 1035 SizeOfPredicates, 7 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 528/752 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: 35]: Loop Invariant Derived loop invariant: ((i == 0) && (j == 0)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (i == 0) RESULT: Ultimate proved your program to be correct! [2024-11-06 22:17:53,806 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