./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 91b08fdaea77c510397a986e449fce03f50498e0d8db198e53038e606f1bccca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:39:35,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:39:36,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:39:36,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:39:36,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:39:36,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:39:36,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:39:36,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:39:36,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:39:36,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:39:36,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:39:36,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:39:36,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:39:36,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:39:36,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:39:36,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:39:36,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:39:36,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:39:36,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:39:36,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:39:36,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:39:36,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:39:36,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:39:36,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:39:36,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:39:36,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:39:36,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:39:36,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:39:36,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:39:36,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:39:36,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:39:36,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:39:36,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:39:36,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:39:36,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:39:36,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:39:36,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:39:36,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:39:36,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:39:36,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:39:36,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:39:36,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:39:36,129 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 91b08fdaea77c510397a986e449fce03f50498e0d8db198e53038e606f1bccca [2024-10-11 00:39:36,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:39:36,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:39:36,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:39:36,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:39:36,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:39:36,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c [2024-10-11 00:39:38,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:39:38,242 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:39:38,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c [2024-10-11 00:39:38,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/309f7e958/344da00e0a764b018c4d446d3f4540cf/FLAG438d25040 [2024-10-11 00:39:38,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/309f7e958/344da00e0a764b018c4d446d3f4540cf [2024-10-11 00:39:38,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:39:38,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:39:38,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:39:38,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:39:38,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:39:38,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6d7c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38, skipping insertion in model container [2024-10-11 00:39:38,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:39:38,569 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c[2355,2368] [2024-10-11 00:39:38,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:39:38,594 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:39:38,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c[2355,2368] [2024-10-11 00:39:38,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:39:38,658 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:39:38,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38 WrapperNode [2024-10-11 00:39:38,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:39:38,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:39:38,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:39:38,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:39:38,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,724 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 210 [2024-10-11 00:39:38,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:39:38,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:39:38,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:39:38,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:39:38,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,770 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 3, 3, 3]. 27 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2024-10-11 00:39:38,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:39:38,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:39:38,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:39:38,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:39:38,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (1/1) ... [2024-10-11 00:39:38,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:39:38,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:39:38,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:39:38,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:39:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:39:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:39:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 00:39:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 00:39:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 00:39:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:39:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 00:39:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 00:39:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 00:39:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 00:39:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 00:39:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 00:39:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 00:39:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 00:39:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 00:39:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 00:39:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 00:39:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 00:39:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:39:38,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:39:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 00:39:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 00:39:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 00:39:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 00:39:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:39:39,034 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:39:39,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:39:39,430 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-11 00:39:39,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:39:39,470 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:39:39,471 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 00:39:39,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:39 BoogieIcfgContainer [2024-10-11 00:39:39,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:39:39,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:39:39,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:39:39,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:39:39,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:38" (1/3) ... [2024-10-11 00:39:39,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cce4def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:39, skipping insertion in model container [2024-10-11 00:39:39,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:38" (2/3) ... [2024-10-11 00:39:39,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cce4def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:39, skipping insertion in model container [2024-10-11 00:39:39,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:39" (3/3) ... [2024-10-11 00:39:39,485 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032c.c [2024-10-11 00:39:39,505 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:39:39,506 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:39:39,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:39:39,584 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;@70e3ba10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:39:39,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:39:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 69 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:39:39,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:39,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:39,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1498193918, now seen corresponding path program 1 times [2024-10-11 00:39:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:39:39,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117528916] [2024-10-11 00:39:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:39:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:39:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117528916] [2024-10-11 00:39:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117528916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:39:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464768358] [2024-10-11 00:39:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:39,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:39:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:39:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:39:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:39:39,834 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 69 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:39,876 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2024-10-11 00:39:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:39:39,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 00:39:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:39,891 INFO L225 Difference]: With dead ends: 139 [2024-10-11 00:39:39,891 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 00:39:39,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-11 00:39:39,921 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:39,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:39:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 00:39:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 00:39:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 67 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-11 00:39:39,981 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 17 [2024-10-11 00:39:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-11 00:39:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-11 00:39:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 00:39:39,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:39,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:39,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:39:39,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:39,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash 207362168, now seen corresponding path program 1 times [2024-10-11 00:39:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:39:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263857319] [2024-10-11 00:39:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:39:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:39:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263857319] [2024-10-11 00:39:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263857319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:39:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952638096] [2024-10-11 00:39:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:40,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:39:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:39:40,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:39:40,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:40,293 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:40,384 INFO L93 Difference]: Finished difference Result 130 states and 184 transitions. [2024-10-11 00:39:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:39:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 00:39:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:40,386 INFO L225 Difference]: With dead ends: 130 [2024-10-11 00:39:40,387 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 00:39:40,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:40,389 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:39:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 00:39:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 00:39:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-10-11 00:39:40,398 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 19 [2024-10-11 00:39:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:40,399 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-10-11 00:39:40,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-10-11 00:39:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 00:39:40,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:40,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:40,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:39:40,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:40,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2065966864, now seen corresponding path program 1 times [2024-10-11 00:39:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:39:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188922907] [2024-10-11 00:39:40,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:39:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:39:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188922907] [2024-10-11 00:39:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188922907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:39:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741656021] [2024-10-11 00:39:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:39:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:39:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:39:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:40,721 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:40,809 INFO L93 Difference]: Finished difference Result 134 states and 188 transitions. [2024-10-11 00:39:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:39:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 00:39:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:40,813 INFO L225 Difference]: With dead ends: 134 [2024-10-11 00:39:40,813 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 00:39:40,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:40,817 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:40,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:39:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 00:39:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 00:39:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-11 00:39:40,829 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 20 [2024-10-11 00:39:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:40,829 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-11 00:39:40,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-11 00:39:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 00:39:40,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:40,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:40,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:39:40,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:40,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1807801426, now seen corresponding path program 1 times [2024-10-11 00:39:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:39:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412703131] [2024-10-11 00:39:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:39:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:41,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:39:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412703131] [2024-10-11 00:39:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412703131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:39:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328108997] [2024-10-11 00:39:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:39:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:39:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:39:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:41,188 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:41,268 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-10-11 00:39:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:39:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 00:39:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:41,270 INFO L225 Difference]: With dead ends: 84 [2024-10-11 00:39:41,270 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 00:39:41,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:41,271 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:41,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 257 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:39:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 00:39:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-11 00:39:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2024-10-11 00:39:41,288 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 20 [2024-10-11 00:39:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:41,289 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2024-10-11 00:39:41,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2024-10-11 00:39:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 00:39:41,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:41,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:41,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:39:41,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:41,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1835654275, now seen corresponding path program 1 times [2024-10-11 00:39:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:39:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330405835] [2024-10-11 00:39:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:39:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:39:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330405835] [2024-10-11 00:39:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330405835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:41,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:39:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986891481] [2024-10-11 00:39:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:41,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:39:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:39:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:39:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:41,492 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:41,518 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2024-10-11 00:39:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:39:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 00:39:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:41,520 INFO L225 Difference]: With dead ends: 83 [2024-10-11 00:39:41,523 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 00:39:41,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:39:41,525 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:41,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:39:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 00:39:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-11 00:39:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-10-11 00:39:41,531 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 21 [2024-10-11 00:39:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:41,532 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-10-11 00:39:41,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-10-11 00:39:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 00:39:41,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:41,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:41,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:39:41,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:41,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2123219281, now seen corresponding path program 1 times [2024-10-11 00:39:41,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:39:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314136698] [2024-10-11 00:39:41,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:39:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:39:41,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:39:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:39:41,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:39:41,668 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:39:41,669 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:39:41,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:39:41,678 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 00:39:41,702 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:39:41,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:39:41 BoogieIcfgContainer [2024-10-11 00:39:41,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:39:41,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:39:41,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:39:41,711 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:39:41,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:39" (3/4) ... [2024-10-11 00:39:41,714 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:39:41,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:39:41,717 INFO L158 Benchmark]: Toolchain (without parser) took 3445.07ms. Allocated memory is still 163.6MB. Free memory was 95.9MB in the beginning and 62.8MB in the end (delta: 33.1MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-10-11 00:39:41,717 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 79.3MB in the end (delta: 121.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:39:41,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.27ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 82.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 00:39:41,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.31ms. Allocated memory is still 163.6MB. Free memory was 82.3MB in the beginning and 80.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:39:41,718 INFO L158 Benchmark]: Boogie Preprocessor took 76.21ms. Allocated memory is still 163.6MB. Free memory was 80.0MB in the beginning and 76.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:39:41,718 INFO L158 Benchmark]: RCFGBuilder took 666.01ms. Allocated memory is still 163.6MB. Free memory was 76.9MB in the beginning and 119.7MB in the end (delta: -42.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-11 00:39:41,718 INFO L158 Benchmark]: TraceAbstraction took 2234.99ms. Allocated memory is still 163.6MB. Free memory was 118.9MB in the beginning and 62.8MB in the end (delta: 56.1MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-10-11 00:39:41,718 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 163.6MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:39:41,723 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.17ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 79.3MB in the end (delta: 121.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.27ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 82.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.31ms. Allocated memory is still 163.6MB. Free memory was 82.3MB in the beginning and 80.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.21ms. Allocated memory is still 163.6MB. Free memory was 80.0MB in the beginning and 76.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 666.01ms. Allocated memory is still 163.6MB. Free memory was 76.9MB in the beginning and 119.7MB in the end (delta: -42.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2234.99ms. Allocated memory is still 163.6MB. Free memory was 118.9MB in the beginning and 62.8MB in the end (delta: 56.1MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 163.6MB. Free memory is still 62.8MB. 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: 93]: 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 bitwiseOr at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L88] double x = 1.0 / 0.0; [L89] CALL, EXPR round_double(x) [L17] __int32_t msw, exponent_less_1023; [L18] __uint32_t lsw; [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (msw) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (lsw) = ew_u.parts.lsw [L25] EXPR msw & 0x7ff00000 VAL [lsw=6441402369, msw=2146435072, x=6441402382] [L25] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L26] COND FALSE !(exponent_less_1023 < 20) VAL [exponent_less_1023=1024, lsw=6441402369, msw=2146435072, x=6441402382] [L40] COND TRUE exponent_less_1023 > 51 VAL [exponent_less_1023=1024, lsw=6441402369, msw=2146435072, x=6441402382] [L41] COND TRUE exponent_less_1023 == 1024 [L42] return x + x; VAL [lsw=6441402369, msw=2146435072, x=6441402382] [L89] RET, EXPR round_double(x) [L89] double res = round_double(x); [L92] CALL, EXPR isinf_double(res) [L67] __int32_t hx, lx; VAL [x=6441402383] [L69] ieee_double_shape_type ew_u; [L70] ew_u.value = (x) [L71] EXPR ew_u.parts.msw [L71] (hx) = ew_u.parts.msw [L72] EXPR ew_u.parts.lsw [L72] (lx) = ew_u.parts.lsw [L74] hx &= 0x7fffffff VAL [hx=0, lx=0, x=6441402383] [L75] EXPR lx | (-lx) VAL [hx=0, x=6441402383] [L75] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L76] hx = 0x7ff00000 - hx VAL [hx=2146435072, x=6441402383] [L77] EXPR hx | (-hx) VAL [x=6441402383] [L77] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L92] RET, EXPR isinf_double(res) [L92] COND TRUE !isinf_double(res) [L93] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 460 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-10-11 00:39:41,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 91b08fdaea77c510397a986e449fce03f50498e0d8db198e53038e606f1bccca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:39:44,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:39:44,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:39:44,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:39:44,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:39:44,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:39:44,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:39:44,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:39:44,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:39:44,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:39:44,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:39:44,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:39:44,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:39:44,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:39:44,333 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:39:44,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:39:44,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:39:44,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:39:44,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:39:44,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:39:44,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:39:44,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:39:44,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:39:44,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:39:44,340 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:39:44,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:39:44,341 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:39:44,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:39:44,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:39:44,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:39:44,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:39:44,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:39:44,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:39:44,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:39:44,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:39:44,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:39:44,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:39:44,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:39:44,345 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:39:44,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:39:44,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:39:44,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:39:44,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:39:44,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:39:44,349 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:39:44,349 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 91b08fdaea77c510397a986e449fce03f50498e0d8db198e53038e606f1bccca [2024-10-11 00:39:44,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:39:44,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:39:44,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:39:44,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:39:44,777 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:39:44,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c [2024-10-11 00:39:46,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:39:46,831 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:39:46,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c [2024-10-11 00:39:46,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/47c3039b5/926e9cdf1f6e418c94a60cd52f4a2a69/FLAG2e46345d2 [2024-10-11 00:39:46,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/47c3039b5/926e9cdf1f6e418c94a60cd52f4a2a69 [2024-10-11 00:39:46,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:39:46,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:39:46,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:39:46,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:39:46,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:39:46,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:46" (1/1) ... [2024-10-11 00:39:46,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a792cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:46, skipping insertion in model container [2024-10-11 00:39:46,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:46" (1/1) ... [2024-10-11 00:39:46,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:39:47,139 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c[2355,2368] [2024-10-11 00:39:47,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:39:47,178 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:39:47,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032c.c[2355,2368] [2024-10-11 00:39:47,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:39:47,245 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:39:47,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47 WrapperNode [2024-10-11 00:39:47,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:39:47,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:39:47,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:39:47,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:39:47,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,296 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2024-10-11 00:39:47,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:39:47,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:39:47,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:39:47,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:39:47,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,343 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 3, 3, 3]. 27 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 2, 1]. [2024-10-11 00:39:47,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:39:47,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:39:47,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:39:47,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:39:47,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (1/1) ... [2024-10-11 00:39:47,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:39:47,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:39:47,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:39:47,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:39:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:39:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 00:39:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 00:39:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 00:39:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 00:39:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 00:39:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 00:39:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 00:39:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 00:39:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:39:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 00:39:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 00:39:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 00:39:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:39:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 00:39:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 00:39:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 00:39:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 00:39:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:39:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:39:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 00:39:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 00:39:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 00:39:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 00:39:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:39:47,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:39:47,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:39:47,976 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-11 00:39:47,977 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:39:48,020 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:39:48,021 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 00:39:48,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:48 BoogieIcfgContainer [2024-10-11 00:39:48,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:39:48,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:39:48,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:39:48,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:39:48,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:46" (1/3) ... [2024-10-11 00:39:48,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8bbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:48, skipping insertion in model container [2024-10-11 00:39:48,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:47" (2/3) ... [2024-10-11 00:39:48,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8bbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:48, skipping insertion in model container [2024-10-11 00:39:48,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:48" (3/3) ... [2024-10-11 00:39:48,033 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032c.c [2024-10-11 00:39:48,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:39:48,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:39:48,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:39:48,117 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;@29bcc46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:39:48,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:39:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 00:39:48,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:48,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:48,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1693255186, now seen corresponding path program 1 times [2024-10-11 00:39:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:39:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916264001] [2024-10-11 00:39:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:48,153 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-10-11 00:39:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:39:48,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 00:39:48,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:39:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:48,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 00:39:48,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:39:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:48,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:39:48,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:39:48,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916264001] [2024-10-11 00:39:48,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916264001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:48,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:48,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:39:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394868786] [2024-10-11 00:39:48,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:39:48,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:39:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:39:48,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:39:48,347 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:48,374 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2024-10-11 00:39:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:39:48,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 00:39:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:48,385 INFO L225 Difference]: With dead ends: 51 [2024-10-11 00:39:48,385 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:39:48,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-10-11 00:39:48,392 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:48,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:39:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:39:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 00:39:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 00:39:48,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2024-10-11 00:39:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:48,434 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 00:39:48,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 00:39:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:39:48,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:48,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:48,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:39:48,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 00:39:48,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:48,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 978488103, now seen corresponding path program 1 times [2024-10-11 00:39:48,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:39:48,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273701004] [2024-10-11 00:39:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:48,639 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-10-11 00:39:48,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:39:48,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 00:39:48,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:39:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:48,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 00:39:48,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:39:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:49,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:39:49,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:39:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273701004] [2024-10-11 00:39:49,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273701004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:49,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:49,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:39:49,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128485939] [2024-10-11 00:39:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:49,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:39:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:39:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:39:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:39:49,053 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:49,378 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-11 00:39:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 00:39:49,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 00:39:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:49,380 INFO L225 Difference]: With dead ends: 31 [2024-10-11 00:39:49,380 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 00:39:49,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:39:49,381 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:49,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 00:39:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 00:39:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 00:39:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-10-11 00:39:49,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2024-10-11 00:39:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:49,386 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-10-11 00:39:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-10-11 00:39:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:39:49,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:39:49,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:39:49,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:39:49,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 00:39:49,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:39:49,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:39:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1942179685, now seen corresponding path program 1 times [2024-10-11 00:39:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:39:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931374987] [2024-10-11 00:39:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:39:49,591 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-10-11 00:39:49,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:39:49,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 00:39:49,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:39:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:39:49,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 00:39:49,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:39:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:39:50,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:39:50,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:39:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931374987] [2024-10-11 00:39:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931374987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:39:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:39:50,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 00:39:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546334714] [2024-10-11 00:39:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:39:50,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:39:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:39:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:39:50,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:39:50,021 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:39:50,188 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-10-11 00:39:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 00:39:50,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 00:39:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:39:50,189 INFO L225 Difference]: With dead ends: 14 [2024-10-11 00:39:50,189 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 00:39:50,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 00:39:50,191 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:39:50,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:39:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 00:39:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 00:39:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 00:39:50,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-10-11 00:39:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:39:50,193 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 00:39:50,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:39:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 00:39:50,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 00:39:50,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:39:50,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 00:39:50,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 00:39:50,400 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 00:39:50,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 00:39:50,454 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:39:50,472 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 00:39:50,473 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 00:39:50,474 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 00:39:50,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 00:39:50,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:39:50 BoogieIcfgContainer [2024-10-11 00:39:50,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:39:50,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:39:50,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:39:50,480 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:39:50,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:48" (3/4) ... [2024-10-11 00:39:50,483 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 00:39:50,499 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-11 00:39:50,501 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 00:39:50,501 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 00:39:50,502 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 00:39:50,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 00:39:50,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 00:39:50,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:39:50,610 INFO L158 Benchmark]: Toolchain (without parser) took 3751.18ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 37.7MB in the beginning and 59.5MB in the end (delta: -21.8MB). Peak memory consumption was 261.1kB. Max. memory is 16.1GB. [2024-10-11 00:39:50,611 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 50.3MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:39:50,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.59ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 41.5MB in the end (delta: -4.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-10-11 00:39:50,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.75ms. Allocated memory is still 71.3MB. Free memory was 41.5MB in the beginning and 39.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:39:50,612 INFO L158 Benchmark]: Boogie Preprocessor took 82.03ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 36.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:39:50,612 INFO L158 Benchmark]: RCFGBuilder took 635.40ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 39.3MB in the end (delta: -2.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-11 00:39:50,612 INFO L158 Benchmark]: TraceAbstraction took 2453.68ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 38.6MB in the beginning and 64.6MB in the end (delta: -26.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:39:50,612 INFO L158 Benchmark]: Witness Printer took 129.82ms. Allocated memory is still 92.3MB. Free memory was 64.6MB in the beginning and 59.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 00:39:50,614 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.25ms. Allocated memory is still 50.3MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.59ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 41.5MB in the end (delta: -4.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.75ms. Allocated memory is still 71.3MB. Free memory was 41.5MB in the beginning and 39.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.03ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 36.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 635.40ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 39.3MB in the end (delta: -2.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2453.68ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 38.6MB in the beginning and 64.6MB in the end (delta: -26.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 129.82ms. Allocated memory is still 92.3MB. Free memory was 64.6MB in the beginning and 59.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 41 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 7 QuantifiedInterpolants, 327 SizeOfPredicates, 8 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-11 00:39:50,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE