./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:34:57,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:34:57,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:34:57,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:34:57,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:34:57,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:34:57,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:34:57,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:34:57,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:34:57,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:34:57,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:34:57,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:34:57,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:34:57,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:34:57,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:34:57,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:34:57,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:34:57,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:34:57,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:34:57,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:34:57,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:34:57,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:34:57,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:34:57,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:34:57,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:34:57,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:34:57,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:34:57,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:34:57,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:34:57,625 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 -> 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 [2024-11-07 08:34:57,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:34:57,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:34:57,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:34:57,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:34:57,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:34:57,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2024-11-07 08:34:59,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:34:59,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:34:59,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2024-11-07 08:34:59,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21bddc2d1/849fe4f93b5f4980ae0af0333dc529b9/FLAGa05e8cf19 [2024-11-07 08:34:59,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21bddc2d1/849fe4f93b5f4980ae0af0333dc529b9 [2024-11-07 08:34:59,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:34:59,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:34:59,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:34:59,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:34:59,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:34:59,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d59fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59, skipping insertion in model container [2024-11-07 08:34:59,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:34:59,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2024-11-07 08:34:59,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:34:59,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:34:59,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2024-11-07 08:34:59,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:34:59,778 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:34:59,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59 WrapperNode [2024-11-07 08:34:59,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:34:59,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:34:59,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:34:59,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:34:59,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,836 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-07 08:34:59,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:34:59,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:34:59,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:34:59,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:34:59,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:34:59,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:34:59,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:34:59,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:34:59,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:34:59,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (1/1) ... [2024-11-07 08:34:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:34:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:34:59,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:34:59,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:34:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:34:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:34:59,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:34:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:34:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:34:59,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:35:00,035 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:35:00,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:35:00,341 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 08:35:00,342 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:35:00,350 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:35:00,350 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:35:00,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:00 BoogieIcfgContainer [2024-11-07 08:35:00,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:35:00,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:35:00,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:35:00,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:35:00,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:34:59" (1/3) ... [2024-11-07 08:35:00,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ac3ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:00, skipping insertion in model container [2024-11-07 08:35:00,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:59" (2/3) ... [2024-11-07 08:35:00,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ac3ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:00, skipping insertion in model container [2024-11-07 08:35:00,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:00" (3/3) ... [2024-11-07 08:35:00,362 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-70.i [2024-11-07 08:35:00,373 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:35:00,374 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:35:00,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:35:00,442 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;@79e7914a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:35:00,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:35:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 08:35:00,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:00,453 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:00,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:00,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash -951076047, now seen corresponding path program 1 times [2024-11-07 08:35:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524110542] [2024-11-07 08:35:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524110542] [2024-11-07 08:35:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524110542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:00,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:00,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:35:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960824514] [2024-11-07 08:35:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:00,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:35:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:00,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:35:00,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:00,787 INFO L87 Difference]: Start difference. First operand has 59 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 08:35:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:00,809 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2024-11-07 08:35:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:35:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-07 08:35:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:00,818 INFO L225 Difference]: With dead ends: 111 [2024-11-07 08:35:00,819 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 08:35:00,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:00,826 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:00,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:35:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 08:35:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-07 08:35:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-11-07 08:35:00,871 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 90 [2024-11-07 08:35:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:00,872 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-11-07 08:35:00,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 08:35:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-11-07 08:35:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 08:35:00,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:00,877 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:00,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:35:00,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1209426125, now seen corresponding path program 1 times [2024-11-07 08:35:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061617116] [2024-11-07 08:35:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:00,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061617116] [2024-11-07 08:35:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061617116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:02,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:02,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:35:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941361160] [2024-11-07 08:35:02,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:35:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:02,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:35:02,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:35:02,415 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:03,076 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2024-11-07 08:35:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:35:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-07 08:35:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:03,081 INFO L225 Difference]: With dead ends: 192 [2024-11-07 08:35:03,081 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 08:35:03,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:35:03,082 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 223 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:03,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 257 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:35:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 08:35:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 61. [2024-11-07 08:35:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-07 08:35:03,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 90 [2024-11-07 08:35:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:03,101 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-07 08:35:03,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-07 08:35:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 08:35:03,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:03,102 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:03,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:35:03,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:03,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1310533809, now seen corresponding path program 1 times [2024-11-07 08:35:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693706336] [2024-11-07 08:35:03,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:04,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:04,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693706336] [2024-11-07 08:35:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693706336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:04,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:04,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:35:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408583054] [2024-11-07 08:35:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:04,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:35:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:04,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:35:04,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:35:04,514 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:04,859 INFO L93 Difference]: Finished difference Result 146 states and 211 transitions. [2024-11-07 08:35:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:35:04,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-07 08:35:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:04,861 INFO L225 Difference]: With dead ends: 146 [2024-11-07 08:35:04,861 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 08:35:04,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:35:04,862 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:04,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 194 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:35:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 08:35:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2024-11-07 08:35:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-07 08:35:04,872 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 90 [2024-11-07 08:35:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:04,873 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-07 08:35:04,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-07 08:35:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 08:35:04,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:04,875 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:04,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:35:04,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:04,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1796232139, now seen corresponding path program 1 times [2024-11-07 08:35:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584686219] [2024-11-07 08:35:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:05,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584686219] [2024-11-07 08:35:05,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584686219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:05,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:05,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:35:05,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41338771] [2024-11-07 08:35:05,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:05,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:35:05,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:05,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:35:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:35:05,050 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:05,089 INFO L93 Difference]: Finished difference Result 154 states and 221 transitions. [2024-11-07 08:35:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:35:05,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-07 08:35:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:05,091 INFO L225 Difference]: With dead ends: 154 [2024-11-07 08:35:05,091 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 08:35:05,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:35:05,092 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:05,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 273 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:35:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 08:35:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2024-11-07 08:35:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-07 08:35:05,106 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 90 [2024-11-07 08:35:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-07 08:35:05,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-07 08:35:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 08:35:05,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:05,111 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:05,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:35:05,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:05,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1774238924, now seen corresponding path program 1 times [2024-11-07 08:35:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:05,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366587883] [2024-11-07 08:35:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:05,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 08:35:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366587883] [2024-11-07 08:35:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366587883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:35:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054486367] [2024-11-07 08:35:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:35:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:35:05,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:35:05,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:35:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:05,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 08:35:05,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:35:06,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:35:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 08:35:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054486367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:35:06,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:35:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21 [2024-11-07 08:35:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285869852] [2024-11-07 08:35:06,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:35:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 08:35:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 08:35:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:35:06,458 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-07 08:35:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:06,990 INFO L93 Difference]: Finished difference Result 176 states and 243 transitions. [2024-11-07 08:35:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:35:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 93 [2024-11-07 08:35:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:06,994 INFO L225 Difference]: With dead ends: 176 [2024-11-07 08:35:06,994 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 08:35:06,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2024-11-07 08:35:06,996 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 266 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:06,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 416 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:35:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 08:35:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2024-11-07 08:35:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2875) internal successors, (103), 81 states have internal predecessors, (103), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:35:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2024-11-07 08:35:07,013 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 93 [2024-11-07 08:35:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:07,014 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2024-11-07 08:35:07,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-07 08:35:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2024-11-07 08:35:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 08:35:07,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:07,018 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:07,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:35:07,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:35:07,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1466201356, now seen corresponding path program 1 times [2024-11-07 08:35:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692622235] [2024-11-07 08:35:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692622235] [2024-11-07 08:35:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692622235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:35:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073676882] [2024-11-07 08:35:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:35:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:07,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:35:07,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:35:07,864 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:08,373 INFO L93 Difference]: Finished difference Result 183 states and 231 transitions. [2024-11-07 08:35:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 08:35:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-07 08:35:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:08,377 INFO L225 Difference]: With dead ends: 183 [2024-11-07 08:35:08,377 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 08:35:08,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:35:08,379 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 184 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:08,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 480 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:35:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 08:35:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2024-11-07 08:35:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 90 states have internal predecessors, (114), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:35:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-11-07 08:35:08,394 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 93 [2024-11-07 08:35:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:08,394 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-11-07 08:35:08,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-11-07 08:35:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 08:35:08,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:08,396 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:08,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:35:08,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:08,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1073174346, now seen corresponding path program 1 times [2024-11-07 08:35:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301355794] [2024-11-07 08:35:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:35:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:35:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:35:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:35:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:35:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:35:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:35:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:35:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:35:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:35:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:35:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:35:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:35:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:35:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301355794] [2024-11-07 08:35:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301355794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:35:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822343058] [2024-11-07 08:35:09,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:35:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:35:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:35:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:35:09,016 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:09,438 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2024-11-07 08:35:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:35:09,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-07 08:35:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:09,440 INFO L225 Difference]: With dead ends: 118 [2024-11-07 08:35:09,440 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 08:35:09,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:35:09,441 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 37 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:09,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 490 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:35:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 08:35:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2024-11-07 08:35:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 85 states have internal predecessors, (107), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:35:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2024-11-07 08:35:09,461 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 93 [2024-11-07 08:35:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2024-11-07 08:35:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2024-11-07 08:35:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 08:35:09,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:09,462 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:35:09,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1909100496, now seen corresponding path program 1 times [2024-11-07 08:35:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:35:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134604275] [2024-11-07 08:35:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:35:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:35:09,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:35:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:35:09,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:35:09,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:35:09,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:35:09,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:09,618 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:35:09,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:35:09 BoogieIcfgContainer [2024-11-07 08:35:09,621 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:35:09,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:35:09,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:35:09,622 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:35:09,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:00" (3/4) ... [2024-11-07 08:35:09,624 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:35:09,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:35:09,626 INFO L158 Benchmark]: Toolchain (without parser) took 10119.91ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 92.0MB in the beginning and 83.6MB in the end (delta: 8.5MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:09,626 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:09,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.31ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:09,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.37ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:09,627 INFO L158 Benchmark]: Boogie Preprocessor took 51.22ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 73.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:09,627 INFO L158 Benchmark]: RCFGBuilder took 458.81ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 55.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:35:09,627 INFO L158 Benchmark]: TraceAbstraction took 9266.40ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 54.9MB in the beginning and 83.6MB in the end (delta: -28.8MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2024-11-07 08:35:09,627 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 234.9MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:09,629 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.91ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.31ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.37ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.22ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 73.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 458.81ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 55.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9266.40ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 54.9MB in the beginning and 83.6MB in the end (delta: -28.8MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 234.9MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; VAL [isInitial=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L81] isInitial = 1 [L82] FCALL initially() [L83] COND TRUE 1 [L84] FCALL updateLastVariables() [L85] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L85] RET updateVariables() [L86] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L86] RET step() [L87] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L87] RET, EXPR property() [L87] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 8, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 773 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 2188 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1695 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 493 mSDtfsCounter, 1392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 7 MinimizatonAttempts, 207 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 4061 SizeOfPredicates, 7 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2718/2808 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:35:09,658 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:35:11,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:35:12,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:35:12,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:35:12,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:35:12,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:35:12,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:35:12,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:35:12,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:35:12,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:35:12,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:35:12,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:35:12,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:35:12,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:35:12,155 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:35:12,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:35:12,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:35:12,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:35:12,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:35:12,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:35:12,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:35:12,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:35:12,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:35:12,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:35:12,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:35:12,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:35:12,159 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:35:12,159 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:35:12,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:35:12,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:35:12,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:35:12,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:35:12,159 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 -> 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 [2024-11-07 08:35:12,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:35:12,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:35:12,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:35:12,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:35:12,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:35:12,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2024-11-07 08:35:13,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:35:14,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:35:14,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2024-11-07 08:35:14,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2de91ae11/e77f07fa112940daacdf73dafa23eed4/FLAG05de29ef6 [2024-11-07 08:35:14,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2de91ae11/e77f07fa112940daacdf73dafa23eed4 [2024-11-07 08:35:14,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:35:14,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:35:14,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:35:14,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:35:14,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:35:14,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1f8092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14, skipping insertion in model container [2024-11-07 08:35:14,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:35:14,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2024-11-07 08:35:14,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:35:14,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:35:14,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2024-11-07 08:35:14,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:35:14,573 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:35:14,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14 WrapperNode [2024-11-07 08:35:14,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:35:14,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:35:14,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:35:14,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:35:14,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,627 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-07 08:35:14,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:35:14,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:35:14,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:35:14,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:35:14,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:35:14,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:35:14,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:35:14,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:35:14,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:35:14,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (1/1) ... [2024-11-07 08:35:14,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:35:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:35:14,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:35:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:35:14,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:35:14,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:35:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:35:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:35:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:35:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:35:14,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:35:14,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:35:15,024 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 08:35:15,025 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:35:15,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:35:15,034 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:35:15,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:15 BoogieIcfgContainer [2024-11-07 08:35:15,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:35:15,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:35:15,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:35:15,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:35:15,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:35:14" (1/3) ... [2024-11-07 08:35:15,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160558bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:15, skipping insertion in model container [2024-11-07 08:35:15,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:14" (2/3) ... [2024-11-07 08:35:15,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160558bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:15, skipping insertion in model container [2024-11-07 08:35:15,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:15" (3/3) ... [2024-11-07 08:35:15,046 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-70.i [2024-11-07 08:35:15,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:35:15,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:35:15,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:35:15,105 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;@65c52f8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:35:15,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:35:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:35:15,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:15,119 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:15,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:15,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1538762934, now seen corresponding path program 1 times [2024-11-07 08:35:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714586509] [2024-11-07 08:35:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:15,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:35:15,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:35:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:15,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:35:15,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 08:35:15,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:35:15,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:35:15,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714586509] [2024-11-07 08:35:15,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714586509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:15,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:15,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:35:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120518656] [2024-11-07 08:35:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:35:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:35:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:35:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:15,420 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 08:35:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:15,441 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2024-11-07 08:35:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:35:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-07 08:35:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:15,449 INFO L225 Difference]: With dead ends: 81 [2024-11-07 08:35:15,449 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 08:35:15,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:35:15,457 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:15,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:35:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 08:35:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 08:35:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:35:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-07 08:35:15,498 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 86 [2024-11-07 08:35:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:15,499 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-07 08:35:15,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 08:35:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-07 08:35:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:35:15,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:15,504 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:15,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:35:15,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:15,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:15,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash 827841976, now seen corresponding path program 1 times [2024-11-07 08:35:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371988017] [2024-11-07 08:35:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:15,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:15,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:15,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:35:15,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:35:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:15,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 08:35:15,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 187 proven. 69 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 08:35:17,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:35:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 08:35:17,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:35:17,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371988017] [2024-11-07 08:35:17,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371988017] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 08:35:17,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:35:17,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 18 [2024-11-07 08:35:17,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967156174] [2024-11-07 08:35:17,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:17,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:35:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:35:17,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:35:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-07 08:35:17,359 INFO L87 Difference]: Start difference. First operand 40 states and 56 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:17,725 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2024-11-07 08:35:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:35:17,726 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-11-07 08:35:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:17,728 INFO L225 Difference]: With dead ends: 113 [2024-11-07 08:35:17,728 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 08:35:17,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-11-07 08:35:17,730 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:17,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 129 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:35:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 08:35:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2024-11-07 08:35:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:35:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2024-11-07 08:35:17,752 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 86 [2024-11-07 08:35:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:17,753 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2024-11-07 08:35:17,753 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 08:35:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-11-07 08:35:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:35:17,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:17,755 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:35:17,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:35:17,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:17,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:17,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash 829689018, now seen corresponding path program 1 times [2024-11-07 08:35:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341810176] [2024-11-07 08:35:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:35:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:17,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:35:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:35:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:18,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 08:35:18,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:36:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 57 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 08:36:03,023 INFO L311 TraceCheckSpWp]: Computing backward predicates...