./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd --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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:32:40,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:32:40,586 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:32:40,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:32:40,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:32:40,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:32:40,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:32:40,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:32:40,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:32:40,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:32:40,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:32:40,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:32:40,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:32:40,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:32:40,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:32:40,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:32:40,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:32:40,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:32:40,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:32:40,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:32:40,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:32:40,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:32:40,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:32:40,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:32:40,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:32:40,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:32:40,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:32:40,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:32:40,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:32:40,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:32:40,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:32:40,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:32:40,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:32:40,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:32:40,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:32:40,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:32:40,621 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-13 13:32:40,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:32:41,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:32:41,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:32:41,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:32:41,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:32:41,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/interpolation2.c Unable to find full path for "g++" [2024-11-13 13:32:42,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:32:43,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:32:43,218 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-13 13:32:43,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data/0c25fd838/b4ad9cd724f442cc8022d11e1f1093b1/FLAG7b5e5f99f [2024-11-13 13:32:43,255 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data/0c25fd838/b4ad9cd724f442cc8022d11e1f1093b1 [2024-11-13 13:32:43,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:32:43,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:32:43,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:32:43,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:32:43,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:32:43,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9c0fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43, skipping insertion in model container [2024-11-13 13:32:43,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:32:43,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-13 13:32:43,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:32:43,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:32:43,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-13 13:32:43,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:32:43,541 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:32:43,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43 WrapperNode [2024-11-13 13:32:43,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:32:43,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:32:43,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:32:43,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:32:43,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,578 INFO L138 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2024-11-13 13:32:43,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:32:43,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:32:43,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:32:43,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:32:43,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,610 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 6, 8, 8, 6]. 27 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2024-11-13 13:32:43,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:32:43,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:32:43,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:32:43,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:32:43,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (1/1) ... [2024-11-13 13:32:43,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:32:43,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:43,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:32:43,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:32:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:32:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:32:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:32:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:32:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:32:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 13:32:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 13:32:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 13:32:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:32:43,822 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:32:43,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:32:43,976 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 13:32:43,976 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:32:43,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:32:43,986 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:32:43,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:32:43 BoogieIcfgContainer [2024-11-13 13:32:43,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:32:43,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:32:43,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:32:43,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:32:43,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:32:43" (1/3) ... [2024-11-13 13:32:43,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf30673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:32:43, skipping insertion in model container [2024-11-13 13:32:43,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:43" (2/3) ... [2024-11-13 13:32:43,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf30673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:32:43, skipping insertion in model container [2024-11-13 13:32:43,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:32:43" (3/3) ... [2024-11-13 13:32:43,999 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-13 13:32:44,016 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:32:44,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:32:44,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:32:44,107 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;@3009bd56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:32:44,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:32:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:32:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:32:44,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:44,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:44,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:32:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1236162952, now seen corresponding path program 1 times [2024-11-13 13:32:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684831120] [2024-11-13 13:32:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684831120] [2024-11-13 13:32:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684831120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:44,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:32:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160086599] [2024-11-13 13:32:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:44,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:32:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:44,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:32:44,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:32:44,389 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11-13 13:32:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:44,402 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-13 13:32:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:32:44,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11-13 13:32:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:44,413 INFO L225 Difference]: With dead ends: 27 [2024-11-13 13:32:44,413 INFO L226 Difference]: Without dead ends: 12 [2024-11-13 13:32:44,416 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-11-13 13:32:44,419 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:44,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:32:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-13 13:32:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-13 13:32:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:32:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-13 13:32:44,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-13 13:32:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:44,448 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-13 13:32:44,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11-13 13:32:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-13 13:32:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:32:44,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:44,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:44,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:32:44,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:32:44,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1178904650, now seen corresponding path program 1 times [2024-11-13 13:32:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718001409] [2024-11-13 13:32:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:44,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:44,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718001409] [2024-11-13 13:32:44,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718001409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:44,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:32:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586161102] [2024-11-13 13:32:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:44,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:32:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:44,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:32:44,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:32:44,628 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-13 13:32:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:44,647 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-13 13:32:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:32:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-13 13:32:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:44,648 INFO L225 Difference]: With dead ends: 22 [2024-11-13 13:32:44,648 INFO L226 Difference]: Without dead ends: 18 [2024-11-13 13:32:44,649 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-11-13 13:32:44,650 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:44,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:32:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-13 13:32:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2024-11-13 13:32:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:32:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-13 13:32:44,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-13 13:32:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:44,654 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-13 13:32:44,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-13 13:32:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-13 13:32:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:32:44,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:44,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:44,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:32:44,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:32:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2110326903, now seen corresponding path program 1 times [2024-11-13 13:32:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367597468] [2024-11-13 13:32:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:32:44,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:32:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:32:44,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:32:44,753 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:32:44,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:32:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:32:44,763 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 13:32:44,788 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:32:44,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:32:44 BoogieIcfgContainer [2024-11-13 13:32:44,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:32:44,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:32:44,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:32:44,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:32:44,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:32:43" (3/4) ... [2024-11-13 13:32:44,794 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:32:44,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:32:44,796 INFO L158 Benchmark]: Toolchain (without parser) took 1537.04ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 86.8MB in the end (delta: 5.6MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:44,796 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:44,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.42ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:44,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:44,797 INFO L158 Benchmark]: Boogie Preprocessor took 61.50ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:44,798 INFO L158 Benchmark]: RCFGBuilder took 345.16ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 65.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:32:44,798 INFO L158 Benchmark]: TraceAbstraction took 801.99ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 87.4MB in the end (delta: -22.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:44,798 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 117.4MB. Free memory was 86.8MB in the beginning and 86.8MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:32:44,800 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.44ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.42ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.50ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.16ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 65.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 801.99ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 87.4MB in the end (delta: -22.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 117.4MB. Free memory was 86.8MB in the beginning and 86.8MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: 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 someBinaryFLOATComparisonOperation at line 28, overapproximation of someBinaryFLOATComparisonOperation at line 24, overapproximation of someBinaryFLOATComparisonOperation at line 21, overapproximation of someBinaryFLOATComparisonOperation at line 21, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={7:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 6 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=16occurred 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 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-11-13 13:32:44,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd --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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:32:47,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:32:47,657 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:32:47,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:32:47,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:32:47,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:32:47,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:32:47,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:32:47,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:32:47,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:32:47,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:32:47,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:32:47,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:32:47,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:32:47,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:32:47,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:32:47,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:32:47,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:32:47,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:32:47,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:32:47,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:32:47,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:32:47,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:32:47,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:32:47,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-13 13:32:48,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:32:48,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:32:48,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:32:48,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:32:48,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:32:48,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/interpolation2.c Unable to find full path for "g++" [2024-11-13 13:32:50,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:32:50,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:32:50,464 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-13 13:32:50,473 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data/07a2708fb/ebde9459ca554b4fab75c6bb30d85e23/FLAGd7b551698 [2024-11-13 13:32:50,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/data/07a2708fb/ebde9459ca554b4fab75c6bb30d85e23 [2024-11-13 13:32:50,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:32:50,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:32:50,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:32:50,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:32:50,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:32:50,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ece2235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50, skipping insertion in model container [2024-11-13 13:32:50,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:32:50,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-13 13:32:50,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:32:50,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:32:50,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-13 13:32:50,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:32:50,823 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:32:50,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50 WrapperNode [2024-11-13 13:32:50,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:32:50,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:32:50,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:32:50,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:32:50,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,868 INFO L138 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-13 13:32:50,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:32:50,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:32:50,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:32:50,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:32:50,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,909 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 8, 6, 6, 8]. 27 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2024-11-13 13:32:50,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:32:50,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:32:50,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:32:50,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:32:50,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (1/1) ... [2024-11-13 13:32:50,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:32:50,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:50,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:32:50,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 13:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:32:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 13:32:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 13:32:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 13:32:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 13:32:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:32:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 13:32:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 13:32:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 13:32:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 13:32:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 13:32:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:32:51,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:32:51,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:32:51,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:32:51,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:32:55,657 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-13 13:32:55,657 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:32:55,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:32:55,668 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:32:55,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:32:55 BoogieIcfgContainer [2024-11-13 13:32:55,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:32:55,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:32:55,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:32:55,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:32:55,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:32:50" (1/3) ... [2024-11-13 13:32:55,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432cc080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:32:55, skipping insertion in model container [2024-11-13 13:32:55,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:32:50" (2/3) ... [2024-11-13 13:32:55,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432cc080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:32:55, skipping insertion in model container [2024-11-13 13:32:55,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:32:55" (3/3) ... [2024-11-13 13:32:55,686 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-13 13:32:55,703 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:32:55,706 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:32:55,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:32:55,795 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;@1bf57217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:32:55,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:32:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:32:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:32:55,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:55,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:55,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:32:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1236162952, now seen corresponding path program 1 times [2024-11-13 13:32:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:32:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853314757] [2024-11-13 13:32:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:32:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:32:55,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:32:55,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:32:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:56,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:32:56,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:56,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:32:56,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:32:56,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853314757] [2024-11-13 13:32:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853314757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:56,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:32:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050172139] [2024-11-13 13:32:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:56,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:32:56,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:32:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:32:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:32:56,445 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11-13 13:32:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:56,456 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-13 13:32:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:32:56,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11-13 13:32:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:56,465 INFO L225 Difference]: With dead ends: 27 [2024-11-13 13:32:56,465 INFO L226 Difference]: Without dead ends: 12 [2024-11-13 13:32:56,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:32:56,471 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:56,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:32:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-13 13:32:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-13 13:32:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:32:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-13 13:32:56,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-13 13:32:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:56,507 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-13 13:32:56,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11-13 13:32:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-13 13:32:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:32:56,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:56,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:56,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 13:32:56,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:32:56,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:32:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1178904650, now seen corresponding path program 1 times [2024-11-13 13:32:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:32:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214623644] [2024-11-13 13:32:56,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:56,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:32:56,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:32:56,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:32:56,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:32:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:57,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:32:57,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:32:57,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:32:57,231 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:32:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214623644] [2024-11-13 13:32:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214623644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:57,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:32:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179933427] [2024-11-13 13:32:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:57,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:32:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:32:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:32:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:32:57,236 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-13 13:33:00,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:33:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:33:00,802 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-13 13:33:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:33:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-13 13:33:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:33:00,804 INFO L225 Difference]: With dead ends: 19 [2024-11-13 13:33:00,804 INFO L226 Difference]: Without dead ends: 15 [2024-11-13 13:33:00,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:33:00,805 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:33:00,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-13 13:33:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-13 13:33:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-11-13 13:33:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:33:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-13 13:33:00,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-13 13:33:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:33:00,810 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-13 13:33:00,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-13 13:33:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-13 13:33:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:33:00,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:33:00,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:33:00,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 13:33:01,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:33:01,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:33:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:33:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2110326903, now seen corresponding path program 1 times [2024-11-13 13:33:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:33:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488858215] [2024-11-13 13:33:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:33:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:33:01,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:33:01,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 13:33:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:01,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 13:33:01,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:33:06,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 379 [2024-11-13 13:33:06,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 322 [2024-11-13 13:33:07,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:33:07,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 294 [2024-11-13 13:33:07,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 226 [2024-11-13 13:33:20,178 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:28,333 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:40,966 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:50,326 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:03,324 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:11,470 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:16,614 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:22,360 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:30,431 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:38,573 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:52,708 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:59,985 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:10,441 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:18,506 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:23,689 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:31,855 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:41,555 WARN L286 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:50,200 WARN L286 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:59,712 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:04,879 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:17,829 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:25,904 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:31,933 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:40,073 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:54,452 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:02,548 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:10,656 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:18,720 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:31,352 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:37,264 WARN L851 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse3) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-13 13:37:46,690 WARN L286 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:51,718 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:59,144 WARN L286 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:07,252 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:15,335 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:20,925 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:29,099 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:33,143 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse3) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))) is different from false [2024-11-13 13:38:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:38:36,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:38:36,446 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:38:36,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488858215] [2024-11-13 13:38:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488858215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:38:36,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:38:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:38:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889549249] [2024-11-13 13:38:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:38:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:38:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:38:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:38:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=63, Unknown=2, NotChecked=34, Total=132 [2024-11-13 13:38:36,448 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:41,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:38:43,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:38:48,089 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse3) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:38:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:38:48,128 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-13 13:38:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:38:48,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 13:38:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:38:48,129 INFO L225 Difference]: With dead ends: 25 [2024-11-13 13:38:48,129 INFO L226 Difference]: Without dead ends: 21 [2024-11-13 13:38:48,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=35, Invalid=64, Unknown=3, NotChecked=54, Total=156 [2024-11-13 13:38:48,130 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:38:48,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 23 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 1 Unknown, 59 Unchecked, 7.6s Time] [2024-11-13 13:38:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-13 13:38:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-13 13:38:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-13 13:38:48,135 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-11-13 13:38:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:38:48,135 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-13 13:38:48,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-13 13:38:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:38:48,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:38:48,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:38:48,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:38:48,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:38:48,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:38:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:38:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1504582023, now seen corresponding path program 1 times [2024-11-13 13:38:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:38:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238689905] [2024-11-13 13:38:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:38:48,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:38:48,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:38:48,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:38:48,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 13:38:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:38:48,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:38:48,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:38:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:38:48,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:38:48,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:38:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238689905] [2024-11-13 13:38:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238689905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:38:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:38:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:38:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450192801] [2024-11-13 13:38:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:38:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:38:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:38:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:38:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:38:48,812 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:38:48,895 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-13 13:38:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:38:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 13:38:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:38:48,896 INFO L225 Difference]: With dead ends: 24 [2024-11-13 13:38:48,896 INFO L226 Difference]: Without dead ends: 14 [2024-11-13 13:38:48,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:38:48,897 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:38:48,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:38:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-13 13:38:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-13 13:38:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-13 13:38:48,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2024-11-13 13:38:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:38:48,902 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-13 13:38:48,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-13 13:38:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:38:48,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:38:48,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:38:48,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 13:38:49,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:38:49,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:38:49,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:38:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 997140987, now seen corresponding path program 1 times [2024-11-13 13:38:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:38:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500796129] [2024-11-13 13:38:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:38:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:38:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:38:49,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:38:49,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 13:38:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:38:49,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:38:49,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:38:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:38:49,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:38:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:38:49,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:38:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500796129] [2024-11-13 13:38:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500796129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:38:49,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:38:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-13 13:38:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827141529] [2024-11-13 13:38:49,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:38:49,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:38:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:38:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:38:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:38:49,811 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:38:54,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:38:58,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:02,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:06,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:10,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:14,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:18,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:22,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:26,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:27,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:31,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:36,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:39:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:39:36,110 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-13 13:39:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:39:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 12 [2024-11-13 13:39:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:39:36,159 INFO L225 Difference]: With dead ends: 26 [2024-11-13 13:39:36,159 INFO L226 Difference]: Without dead ends: 22 [2024-11-13 13:39:36,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:39:36,160 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:39:36,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 11 Unknown, 0 Unchecked, 46.2s Time] [2024-11-13 13:39:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-13 13:39:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-13 13:39:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:39:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-13 13:39:36,167 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2024-11-13 13:39:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:39:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-13 13:39:36,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:39:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-13 13:39:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:39:36,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:39:36,169 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:39:36,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 13:39:36,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:39:36,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:39:36,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:39:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash 848264914, now seen corresponding path program 1 times [2024-11-13 13:39:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:39:36,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114060779] [2024-11-13 13:39:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:36,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:39:36,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:39:36,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:39:36,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6d382b-4617-4be3-ac43-b2a54d227bf3/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 13:39:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:36,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 13:39:37,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:39:43,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:39:43,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 501 treesize of output 381 [2024-11-13 13:39:43,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 322 [2024-11-13 13:39:43,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:39:43,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 423 treesize of output 315 [2024-11-13 13:39:43,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 226 [2024-11-13 13:39:53,036 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:58,912 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:04,391 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:10,217 WARN L286 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:18,843 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:29,356 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:39,513 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:46,171 WARN L286 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:54,279 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:00,892 WARN L286 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:09,352 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:17,469 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:33,411 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:39,694 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:47,813 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:54,030 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:03,065 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:10,514 WARN L286 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:21,562 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:26,620 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:34,387 WARN L286 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:42,469 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:50,583 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:57,053 WARN L286 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 8 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:12,610 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:20,726 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:26,759 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:38,713 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:44,656 WARN L286 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:50,152 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:43:58,240 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:04,239 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:10,701 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:28,965 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:35,762 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:43,887 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:52,041 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:44:57,828 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:01,896 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-13 13:45:12,553 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:19,147 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:24,814 WARN L286 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:32,970 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:41,195 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:47,031 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:51,097 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) is different from false [2024-11-13 13:45:55,115 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) is different from true [2024-11-13 13:45:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:45:55,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:46:03,570 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:11,902 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:15,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from false [2024-11-13 13:46:20,047 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from true [2024-11-13 13:46:28,269 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:36,503 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:44,793 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:48,855 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|))) is different from false [2024-11-13 13:46:52,917 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|))) is different from true [2024-11-13 13:47:01,157 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:09,417 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:17,765 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:21,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from false [2024-11-13 13:47:25,897 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from true [2024-11-13 13:47:34,121 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:42,346 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:50,591 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:58,819 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:02,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from false [2024-11-13 13:48:06,971 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse3 (_ bv4 32) |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from true