./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_0730c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:18:00,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:18:00,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 17:18:00,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:18:00,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:18:00,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:18:00,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:18:00,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:18:00,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:18:00,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:18:00,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:18:00,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:18:00,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:18:00,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:18:00,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:18:00,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:18:00,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:18:00,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:18:00,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 17:18:00,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:18:00,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:18:00,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:18:00,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:18:00,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:18:00,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:18:00,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:18:00,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:18:00,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:18:00,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:18:00,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:18:00,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:18:00,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:18:00,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:18:00,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:18:00,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:18:00,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:18:00,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 17:18:00,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 17:18:00,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:18:00,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:18:00,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:18:00,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:18:00,400 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/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/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 -> f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d [2024-10-12 17:18:00,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:18:00,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:18:00,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:18:00,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:18:00,680 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:18:00,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2024-10-12 17:18:02,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:18:02,359 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:18:02,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2024-10-12 17:18:02,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7166786/ce82a665d6864896a055c0c5fd176f91/FLAG5f60be187 [2024-10-12 17:18:02,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7166786/ce82a665d6864896a055c0c5fd176f91 [2024-10-12 17:18:02,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:18:02,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:18:02,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:18:02,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:18:02,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:18:02,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:18:02" (1/1) ... [2024-10-12 17:18:02,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1268284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:02, skipping insertion in model container [2024-10-12 17:18:02,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:18:02" (1/1) ... [2024-10-12 17:18:02,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:18:03,040 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_0730c.c[3223,3236] [2024-10-12 17:18:03,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:18:03,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:18:03,088 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_0730c.c[3223,3236] [2024-10-12 17:18:03,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:18:03,104 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:18:03,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03 WrapperNode [2024-10-12 17:18:03,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:18:03,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:18:03,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:18:03,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:18:03,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,160 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 325 [2024-10-12 17:18:03,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:18:03,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:18:03,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:18:03,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:18:03,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,207 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 3, 2, 3]. 30 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, 1, 2]. [2024-10-12 17:18:03,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:18:03,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:18:03,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:18:03,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:18:03,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (1/1) ... [2024-10-12 17:18:03,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:18:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:18:03,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 17:18:03,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 17:18:03,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:18:03,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 17:18:03,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 17:18:03,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 17:18:03,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 17:18:03,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 17:18:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 17:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 17:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:18:03,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:18:03,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:18:04,039 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-12 17:18:04,039 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:18:04,073 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:18:04,077 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-12 17:18:04,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:04 BoogieIcfgContainer [2024-10-12 17:18:04,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:18:04,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:18:04,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:18:04,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:18:04,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:18:02" (1/3) ... [2024-10-12 17:18:04,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cb630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:18:04, skipping insertion in model container [2024-10-12 17:18:04,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:03" (2/3) ... [2024-10-12 17:18:04,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cb630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:18:04, skipping insertion in model container [2024-10-12 17:18:04,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:04" (3/3) ... [2024-10-12 17:18:04,085 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c.c [2024-10-12 17:18:04,098 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:18:04,098 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:18:04,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:18:04,164 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;@3f55b17c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:18:04,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:18:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 106 states have (on average 1.6226415094339623) internal successors, (172), 107 states have internal predecessors, (172), 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-12 17:18:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 17:18:04,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:04,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:04,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1478572668, now seen corresponding path program 1 times [2024-10-12 17:18:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:18:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567949803] [2024-10-12 17:18:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:18:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:04,335 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-12 17:18:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:18:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567949803] [2024-10-12 17:18:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567949803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 17:18:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081173212] [2024-10-12 17:18:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 17:18:04,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:18:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 17:18:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:18:04,362 INFO L87 Difference]: Start difference. First operand has 108 states, 106 states have (on average 1.6226415094339623) internal successors, (172), 107 states have internal predecessors, (172), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12 17:18:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:04,398 INFO L93 Difference]: Finished difference Result 215 states and 343 transitions. [2024-10-12 17:18:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 17:18:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-12 17:18:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:04,412 INFO L225 Difference]: With dead ends: 215 [2024-10-12 17:18:04,412 INFO L226 Difference]: Without dead ends: 106 [2024-10-12 17:18:04,415 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-12 17:18:04,418 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:04,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:18:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-12 17:18:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-12 17:18:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 105 states have internal predecessors, (158), 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-12 17:18:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-10-12 17:18:04,452 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 8 [2024-10-12 17:18:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:04,453 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-10-12 17:18:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12 17:18:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-10-12 17:18:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 17:18:04,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:04,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 17:18:04,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash -502828593, now seen corresponding path program 1 times [2024-10-12 17:18:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:18:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736244884] [2024-10-12 17:18:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:18:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:04,582 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-12 17:18:04,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:18:04,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736244884] [2024-10-12 17:18:04,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736244884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:04,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:18:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9142830] [2024-10-12 17:18:04,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:04,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 17:18:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:18:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 17:18:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:18:04,588 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-12 17:18:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:04,624 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2024-10-12 17:18:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 17:18:04,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-12 17:18:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:04,626 INFO L225 Difference]: With dead ends: 115 [2024-10-12 17:18:04,627 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 17:18:04,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:18:04,630 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:04,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:18:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 17:18:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-12 17:18:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 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-12 17:18:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-12 17:18:04,649 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 9 [2024-10-12 17:18:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:04,650 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-12 17:18:04,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-12 17:18:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-12 17:18:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 17:18:04,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:04,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:04,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 17:18:04,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:04,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1464018591, now seen corresponding path program 1 times [2024-10-12 17:18:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:18:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045389353] [2024-10-12 17:18:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:18:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:18:04,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 17:18:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:18:04,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 17:18:04,762 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 17:18:04,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:18:04,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 17:18:04,767 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 17:18:04,783 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:18:04,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:18:04 BoogieIcfgContainer [2024-10-12 17:18:04,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:18:04,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:18:04,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:18:04,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:18:04,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:04" (3/4) ... [2024-10-12 17:18:04,790 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 17:18:04,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:18:04,792 INFO L158 Benchmark]: Toolchain (without parser) took 2080.73ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 104.5MB in the beginning and 167.3MB in the end (delta: -62.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:18:04,792 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 49.6MB in the beginning and 49.4MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:18:04,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.12ms. Allocated memory is still 163.6MB. Free memory was 104.5MB in the beginning and 129.2MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 17:18:04,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 163.6MB. Free memory was 129.2MB in the beginning and 125.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:18:04,794 INFO L158 Benchmark]: Boogie Preprocessor took 81.97ms. Allocated memory is still 163.6MB. Free memory was 125.8MB in the beginning and 122.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 17:18:04,794 INFO L158 Benchmark]: RCFGBuilder took 833.18ms. Allocated memory is still 163.6MB. Free memory was 122.1MB in the beginning and 88.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-12 17:18:04,795 INFO L158 Benchmark]: TraceAbstraction took 706.56ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 87.2MB in the beginning and 168.3MB in the end (delta: -81.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:18:04,795 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 203.4MB. Free memory was 168.3MB in the beginning and 167.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:18:04,797 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.15ms. Allocated memory is still 96.5MB. Free memory was 49.6MB in the beginning and 49.4MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.12ms. Allocated memory is still 163.6MB. Free memory was 104.5MB in the beginning and 129.2MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 163.6MB. Free memory was 129.2MB in the beginning and 125.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.97ms. Allocated memory is still 163.6MB. Free memory was 125.8MB in the beginning and 122.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 833.18ms. Allocated memory is still 163.6MB. Free memory was 122.1MB in the beginning and 88.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 706.56ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 87.2MB in the beginning and 168.3MB in the end (delta: -81.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 203.4MB. Free memory was 168.3MB in the beginning and 167.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 156]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35. Possible FailurePath: [L19] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L151] double x = 0.0; [L152] CALL, EXPR __ieee754_sqrt(x) [L22] double z; [L23] __int32_t sign = 0x80000000; [L24] __uint32_t r, t1, s1, ix1, q1; [L25] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L28] ieee_double_shape_type ew_u; [L29] ew_u.value = (x) [L30] EXPR ew_u.parts.msw [L30] (ix0) = ew_u.parts.msw [L31] EXPR ew_u.parts.lsw [L31] (ix1) = ew_u.parts.lsw [L34] EXPR ix0 & 0x7ff00000 VAL [ix0=2146435072, ix1=6441402369, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L34] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L35] return x * x + x; VAL [ix0=2146435072, ix1=6441402369, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L152] RET, EXPR __ieee754_sqrt(x) [L152] double res = __ieee754_sqrt(x); [L155] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_sqrt=1, res=6441402378, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L155] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L155] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L156] reach_error() VAL [one_sqrt=1, res=6441402378, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 310 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-12 17:18:04,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:18:07,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:18:07,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 17:18:07,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:18:07,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:18:07,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:18:07,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:18:07,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:18:07,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:18:07,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:18:07,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:18:07,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:18:07,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:18:07,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:18:07,249 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:18:07,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:18:07,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:18:07,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:18:07,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:18:07,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:18:07,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:18:07,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:18:07,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:18:07,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 17:18:07,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 17:18:07,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:18:07,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 17:18:07,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:18:07,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:18:07,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:18:07,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:18:07,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:18:07,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:18:07,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:18:07,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:18:07,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:18:07,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:18:07,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:18:07,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 17:18:07,260 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 17:18:07,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:18:07,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:18:07,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:18:07,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:18:07,261 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 17:18:07,261 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/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/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 -> f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d [2024-10-12 17:18:07,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:18:07,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:18:07,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:18:07,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:18:07,640 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:18:07,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2024-10-12 17:18:09,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:18:09,481 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:18:09,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2024-10-12 17:18:09,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a66d9d27/05e1aa98ef3d4b4db42adc19a054e46c/FLAG23982f107 [2024-10-12 17:18:09,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a66d9d27/05e1aa98ef3d4b4db42adc19a054e46c [2024-10-12 17:18:09,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:18:09,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:18:09,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:18:09,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:18:09,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:18:09,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:18:09" (1/1) ... [2024-10-12 17:18:09,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6433d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:09, skipping insertion in model container [2024-10-12 17:18:09,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:18:09" (1/1) ... [2024-10-12 17:18:09,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:18:10,188 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_0730c.c[3223,3236] [2024-10-12 17:18:10,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:18:10,221 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:18:10,272 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_0730c.c[3223,3236] [2024-10-12 17:18:10,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:18:10,299 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:18:10,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10 WrapperNode [2024-10-12 17:18:10,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:18:10,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:18:10,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:18:10,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:18:10,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,360 INFO L138 Inliner]: procedures = 20, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2024-10-12 17:18:10,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:18:10,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:18:10,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:18:10,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:18:10,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,413 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 2, 3, 3]. 30 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-12 17:18:10,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:18:10,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:18:10,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:18:10,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:18:10,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (1/1) ... [2024-10-12 17:18:10,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:18:10,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:18:10,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 17:18:10,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 17:18:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:18:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-12 17:18:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-12 17:18:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-12 17:18:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-12 17:18:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-12 17:18:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-12 17:18:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-12 17:18:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-12 17:18:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 17:18:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 17:18:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:18:10,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:18:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-12 17:18:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-12 17:18:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-12 17:18:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-12 17:18:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:18:10,708 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:18:10,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:18:13,081 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-10-12 17:18:13,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:18:13,111 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:18:13,111 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-12 17:18:13,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:13 BoogieIcfgContainer [2024-10-12 17:18:13,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:18:13,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:18:13,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:18:13,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:18:13,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:18:09" (1/3) ... [2024-10-12 17:18:13,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9df3bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:18:13, skipping insertion in model container [2024-10-12 17:18:13,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:18:10" (2/3) ... [2024-10-12 17:18:13,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9df3bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:18:13, skipping insertion in model container [2024-10-12 17:18:13,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:13" (3/3) ... [2024-10-12 17:18:13,122 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c.c [2024-10-12 17:18:13,143 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:18:13,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:18:13,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:18:13,204 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;@d44b239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:18:13,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:18:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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-12 17:18:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 17:18:13,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:13,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:13,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1956350542, now seen corresponding path program 1 times [2024-10-12 17:18:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:13,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008009199] [2024-10-12 17:18:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:13,251 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-12 17:18:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:13,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-12 17:18:13,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 17:18:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:13,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 17:18:13,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:18:13,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:13,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008009199] [2024-10-12 17:18:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008009199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 17:18:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761887630] [2024-10-12 17:18:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:13,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 17:18:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:13,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 17:18:13,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:18:13,576 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 17:18:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:13,645 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2024-10-12 17:18:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 17:18:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-12 17:18:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:13,656 INFO L225 Difference]: With dead ends: 97 [2024-10-12 17:18:13,656 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 17:18:13,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-12 17:18:13,663 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:13,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:18:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 17:18:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-12 17:18:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 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-12 17:18:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-10-12 17:18:13,696 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 7 [2024-10-12 17:18:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:13,697 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-10-12 17:18:13,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 17:18:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-10-12 17:18:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 17:18:13,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:13,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:13,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 17:18:13,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-12 17:18:13,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:13,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1505776137, now seen corresponding path program 1 times [2024-10-12 17:18:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:13,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38497568] [2024-10-12 17:18:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:13,901 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-12 17:18:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:13,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-12 17:18:13,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 17:18:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:14,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 17:18:14,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:14,497 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-12 17:18:14,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:14,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38497568] [2024-10-12 17:18:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38497568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:14,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:18:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792308519] [2024-10-12 17:18:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:14,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:18:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:14,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:18:14,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:18:14,503 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-12 17:18:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:15,643 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-10-12 17:18:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:18:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-12 17:18:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:15,645 INFO L225 Difference]: With dead ends: 90 [2024-10-12 17:18:15,645 INFO L226 Difference]: Without dead ends: 50 [2024-10-12 17:18:15,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:18:15,647 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 63 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:15,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 17:18:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-12 17:18:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-10-12 17:18:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-12 17:18:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-12 17:18:15,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 8 [2024-10-12 17:18:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-12 17:18:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-12 17:18:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-10-12 17:18:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 17:18:15,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:15,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:15,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 17:18:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-12 17:18:15,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 942470350, now seen corresponding path program 1 times [2024-10-12 17:18:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:15,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014215687] [2024-10-12 17:18:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:15,862 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-12 17:18:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:15,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-12 17:18:15,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-12 17:18:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:15,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 17:18:15,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:16,373 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-12 17:18:16,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:16,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014215687] [2024-10-12 17:18:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014215687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:16,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:18:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775907895] [2024-10-12 17:18:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:16,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:18:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:16,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:18:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:18:16,378 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:18:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:16,762 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-10-12 17:18:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:18:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-10-12 17:18:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:16,766 INFO L225 Difference]: With dead ends: 53 [2024-10-12 17:18:16,766 INFO L226 Difference]: Without dead ends: 50 [2024-10-12 17:18:16,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:18:16,768 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 50 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:16,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 17:18:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-12 17:18:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-12 17:18:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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-12 17:18:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2024-10-12 17:18:16,775 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 10 [2024-10-12 17:18:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:16,775 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2024-10-12 17:18:16,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 17:18:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2024-10-12 17:18:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 17:18:16,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:16,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:16,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-12 17:18:16,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-12 17:18:16,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:16,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 430385562, now seen corresponding path program 1 times [2024-10-12 17:18:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338838414] [2024-10-12 17:18:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:16,979 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-12 17:18:16,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:16,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-12 17:18:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Waiting until timeout for monitored process [2024-10-12 17:18:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:17,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 17:18:17,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:17,988 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-12 17:18:17,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:17,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338838414] [2024-10-12 17:18:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338838414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 17:18:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508552490] [2024-10-12 17:18:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 17:18:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 17:18:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 17:18:17,992 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-12 17:18:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:18,915 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-12 17:18:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 17:18:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-12 17:18:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:18,917 INFO L225 Difference]: With dead ends: 56 [2024-10-12 17:18:18,917 INFO L226 Difference]: Without dead ends: 48 [2024-10-12 17:18:18,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 17:18:18,919 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:18,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 340 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 17:18:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-12 17:18:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-12 17:18:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 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-12 17:18:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-12 17:18:18,927 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 13 [2024-10-12 17:18:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:18,928 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-12 17:18:18,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-12 17:18:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-12 17:18:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 17:18:18,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:18,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:18,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Ended with exit code 0 [2024-10-12 17:18:19,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-12 17:18:19,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:19,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1134311850, now seen corresponding path program 1 times [2024-10-12 17:18:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328108652] [2024-10-12 17:18:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:19,131 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-12 17:18:19,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:19,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-12 17:18:19,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Waiting until timeout for monitored process [2024-10-12 17:18:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:19,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 17:18:19,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:19,856 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-12 17:18:19,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:19,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328108652] [2024-10-12 17:18:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328108652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:18:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072546858] [2024-10-12 17:18:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:18:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:18:19,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:18:19,858 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-12 17:18:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:20,858 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2024-10-12 17:18:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:18:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-12 17:18:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:20,859 INFO L225 Difference]: With dead ends: 82 [2024-10-12 17:18:20,859 INFO L226 Difference]: Without dead ends: 48 [2024-10-12 17:18:20,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 17:18:20,860 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 57 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:20,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 131 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 17:18:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-12 17:18:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-12 17:18:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 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-12 17:18:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-10-12 17:18:20,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 26 [2024-10-12 17:18:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:20,865 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-12 17:18:20,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-12 17:18:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-10-12 17:18:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 17:18:20,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:20,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:20,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Ended with exit code 0 [2024-10-12 17:18:21,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-12 17:18:21,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:21,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 322680761, now seen corresponding path program 1 times [2024-10-12 17:18:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243771214] [2024-10-12 17:18:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:21,071 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-12 17:18:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:21,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-12 17:18:21,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Waiting until timeout for monitored process [2024-10-12 17:18:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:21,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 17:18:21,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 17:18:21,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:21,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:21,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243771214] [2024-10-12 17:18:21,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243771214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:21,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:21,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:18:21,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109894811] [2024-10-12 17:18:21,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:21,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 17:18:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 17:18:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:18:21,214 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-12 17:18:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:21,440 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2024-10-12 17:18:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 17:18:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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) Word has length 31 [2024-10-12 17:18:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:21,441 INFO L225 Difference]: With dead ends: 79 [2024-10-12 17:18:21,441 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 17:18:21,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:18:21,443 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:21,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 17:18:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 17:18:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-10-12 17:18:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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-12 17:18:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-10-12 17:18:21,449 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 31 [2024-10-12 17:18:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:21,451 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-10-12 17:18:21,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-12 17:18:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-10-12 17:18:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 17:18:21,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:21,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:21,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Forceful destruction successful, exit code 0 [2024-10-12 17:18:21,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-12 17:18:21,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:21,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:21,654 INFO L85 PathProgramCache]: Analyzing trace with hash -434300853, now seen corresponding path program 1 times [2024-10-12 17:18:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:21,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172236219] [2024-10-12 17:18:21,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:21,655 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-12 17:18:21,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:21,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-12 17:18:21,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2024-10-12 17:18:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:21,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:18:21,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 17:18:21,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 17:18:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 17:18:22,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:22,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172236219] [2024-10-12 17:18:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172236219] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 17:18:22,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 17:18:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-12 17:18:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528465010] [2024-10-12 17:18:22,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 17:18:22,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 17:18:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 17:18:22,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 17:18:22,162 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-12 17:18:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:22,600 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2024-10-12 17:18:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 17:18:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 34 [2024-10-12 17:18:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:22,601 INFO L225 Difference]: With dead ends: 86 [2024-10-12 17:18:22,601 INFO L226 Difference]: Without dead ends: 58 [2024-10-12 17:18:22,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 17:18:22,602 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:22,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 115 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 17:18:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-12 17:18:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-12 17:18:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 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-12 17:18:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-10-12 17:18:22,607 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 34 [2024-10-12 17:18:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:22,608 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-10-12 17:18:22,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-12 17:18:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-10-12 17:18:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 17:18:22,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:22,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:22,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Forceful destruction successful, exit code 0 [2024-10-12 17:18:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-12 17:18:22,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:22,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash -441031367, now seen corresponding path program 2 times [2024-10-12 17:18:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422079804] [2024-10-12 17:18:22,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 17:18:22,811 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-12 17:18:22,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:22,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-12 17:18:22,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Waiting until timeout for monitored process [2024-10-12 17:18:22,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 17:18:22,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 17:18:22,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:18:22,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-12 17:18:23,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:23,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:23,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422079804] [2024-10-12 17:18:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422079804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:23,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:18:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131886989] [2024-10-12 17:18:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:18:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:18:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:18:23,733 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-12 17:18:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:24,245 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2024-10-12 17:18:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:18:24,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 43 [2024-10-12 17:18:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:24,247 INFO L225 Difference]: With dead ends: 90 [2024-10-12 17:18:24,248 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 17:18:24,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:18:24,249 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:24,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 17:18:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 17:18:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2024-10-12 17:18:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 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-12 17:18:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-10-12 17:18:24,264 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 43 [2024-10-12 17:18:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:24,267 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-10-12 17:18:24,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-12 17:18:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-10-12 17:18:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 17:18:24,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:24,268 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:24,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Ended with exit code 0 [2024-10-12 17:18:24,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-12 17:18:24,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1283383133, now seen corresponding path program 1 times [2024-10-12 17:18:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221027944] [2024-10-12 17:18:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:18:24,470 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-12 17:18:24,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:24,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-12 17:18:24,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Waiting until timeout for monitored process [2024-10-12 17:18:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:18:24,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 17:18:24,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 17:18:25,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 17:18:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 17:18:26,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221027944] [2024-10-12 17:18:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221027944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 17:18:26,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 17:18:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-12 17:18:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519228040] [2024-10-12 17:18:26,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 17:18:26,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 17:18:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 17:18:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-10-12 17:18:26,181 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-12 17:18:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:27,655 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2024-10-12 17:18:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 17:18:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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 46 [2024-10-12 17:18:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:27,656 INFO L225 Difference]: With dead ends: 106 [2024-10-12 17:18:27,656 INFO L226 Difference]: Without dead ends: 77 [2024-10-12 17:18:27,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-10-12 17:18:27,657 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 28 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:27,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 265 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 17:18:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-12 17:18:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-12 17:18:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 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-12 17:18:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2024-10-12 17:18:27,671 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 46 [2024-10-12 17:18:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:27,672 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2024-10-12 17:18:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-12 17:18:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2024-10-12 17:18:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 17:18:27,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:18:27,674 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:27,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Ended with exit code 0 [2024-10-12 17:18:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-12 17:18:27,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:18:27,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:18:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1729768547, now seen corresponding path program 2 times [2024-10-12 17:18:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:18:27,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807498004] [2024-10-12 17:18:27,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 17:18:27,876 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-12 17:18:27,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:18:27,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-12 17:18:27,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (11)] Waiting until timeout for monitored process [2024-10-12 17:18:27,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 17:18:27,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 17:18:27,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 17:18:27,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:18:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-12 17:18:28,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:18:28,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:18:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807498004] [2024-10-12 17:18:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807498004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:18:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:18:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:18:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011900635] [2024-10-12 17:18:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:18:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:18:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:18:28,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:18:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:18:28,649 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-12 17:18:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:18:28,842 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2024-10-12 17:18:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:18:28,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 64 [2024-10-12 17:18:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:18:28,844 INFO L225 Difference]: With dead ends: 77 [2024-10-12 17:18:28,844 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 17:18:28,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:18:28,852 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:18:28,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:18:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 17:18:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 17:18:28,853 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-12 17:18:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 17:18:28,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-10-12 17:18:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:18:28,854 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 17:18:28,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-12 17:18:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 17:18:28,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 17:18:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:18:28,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (11)] Ended with exit code 0 [2024-10-12 17:18:29,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-12 17:18:29,063 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 17:18:29,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 17:18:29,196 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:18:29,206 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2024-10-12 17:18:29,208 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2024-10-12 17:18:29,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:18:29 BoogieIcfgContainer [2024-10-12 17:18:29,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:18:29,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:18:29,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:18:29,210 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:18:29,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:13" (3/4) ... [2024-10-12 17:18:29,213 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 17:18:29,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-12 17:18:29,221 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-12 17:18:29,222 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 17:18:29,222 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 17:18:29,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 17:18:29,330 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 17:18:29,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:18:29,331 INFO L158 Benchmark]: Toolchain (without parser) took 19448.01ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 43.4MB in the end (delta: -12.1MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-10-12 17:18:29,331 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 50.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:18:29,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.52ms. Allocated memory is still 62.9MB. Free memory was 31.1MB in the beginning and 31.9MB in the end (delta: -776.1kB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-12 17:18:29,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.01ms. Allocated memory is still 62.9MB. Free memory was 31.6MB in the beginning and 29.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:18:29,332 INFO L158 Benchmark]: Boogie Preprocessor took 95.77ms. Allocated memory is still 62.9MB. Free memory was 29.7MB in the beginning and 26.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:18:29,333 INFO L158 Benchmark]: RCFGBuilder took 2650.53ms. Allocated memory is still 62.9MB. Free memory was 26.4MB in the beginning and 25.1MB in the end (delta: 1.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-12 17:18:29,333 INFO L158 Benchmark]: TraceAbstraction took 16095.27ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 24.4MB in the beginning and 49.7MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:18:29,334 INFO L158 Benchmark]: Witness Printer took 119.99ms. Allocated memory is still 75.5MB. Free memory was 49.7MB in the beginning and 43.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 17:18:29,335 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.35ms. Allocated memory is still 50.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.52ms. Allocated memory is still 62.9MB. Free memory was 31.1MB in the beginning and 31.9MB in the end (delta: -776.1kB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.01ms. Allocated memory is still 62.9MB. Free memory was 31.6MB in the beginning and 29.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.77ms. Allocated memory is still 62.9MB. Free memory was 29.7MB in the beginning and 26.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2650.53ms. Allocated memory is still 62.9MB. Free memory was 26.4MB in the beginning and 25.1MB in the end (delta: 1.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16095.27ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 24.4MB in the beginning and 49.7MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 119.99ms. Allocated memory is still 75.5MB. Free memory was 49.7MB in the beginning and 43.4MB in the end (delta: 6.3MB). 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: Missing case for function ~Pluszero~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~64 * 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: 156]: 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 1391 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 887 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 433 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 504 mSDtfsCounter, 433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=9, InterpolantAutomatonStates: 53, 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, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 282 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 350 ConstructedInterpolants, 15 QuantifiedInterpolants, 915 SizeOfPredicates, 15 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 177/223 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: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (sign == -2147483648) RESULT: Ultimate proved your program to be correct! [2024-10-12 17:18:29,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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