./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:52:56,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:52:56,794 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:52:56,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:52:56,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:52:56,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:52:56,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:52:56,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:52:56,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:52:56,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:52:56,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:52:56,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:52:56,832 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:52:56,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:52:56,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:52:56,834 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:52:56,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:52:56,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:52:56,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:52:56,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:52:56,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:52:56,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:52:56,839 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:52:56,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:52:56,840 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:52:56,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:52:56,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:52:56,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:52:56,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:56,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:52:56,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:52:56,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:52:56,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:52:56,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:52:56,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:52:56,849 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:52:56,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:52:56,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:52:56,851 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:52:56,851 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 [2023-11-06 22:52:57,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:52:57,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:52:57,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:52:57,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:52:57,228 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:52:57,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-11-06 22:53:00,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:53:00,858 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:53:00,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-11-06 22:53:00,870 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data/03f5f5c97/1583157d8076465bbc9cca0c24ea7d53/FLAG8659f5cfd [2023-11-06 22:53:00,894 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data/03f5f5c97/1583157d8076465bbc9cca0c24ea7d53 [2023-11-06 22:53:00,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:53:00,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:53:00,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:00,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:53:00,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:53:00,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:00" (1/1) ... [2023-11-06 22:53:00,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d386b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:00, skipping insertion in model container [2023-11-06 22:53:00,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:00" (1/1) ... [2023-11-06 22:53:00,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:53:01,128 WARN L240 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_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i[915,928] [2023-11-06 22:53:01,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:01,192 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:53:01,204 WARN L240 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_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i[915,928] [2023-11-06 22:53:01,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:01,240 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:53:01,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01 WrapperNode [2023-11-06 22:53:01,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:01,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:01,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:53:01,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:53:01,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,292 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-11-06 22:53:01,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:01,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:53:01,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:53:01,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:53:01,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:53:01,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:53:01,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:53:01,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:53:01,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (1/1) ... [2023-11-06 22:53:01,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:01,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:01,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:53:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:53:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:53:01,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:53:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:53:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:53:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:53:01,530 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:53:01,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:53:01,824 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:53:01,856 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:53:01,857 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:53:01,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:01 BoogieIcfgContainer [2023-11-06 22:53:01,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:53:01,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:53:01,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:53:01,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:53:01,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:00" (1/3) ... [2023-11-06 22:53:01,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fc5545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:01, skipping insertion in model container [2023-11-06 22:53:01,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:01" (2/3) ... [2023-11-06 22:53:01,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fc5545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:01, skipping insertion in model container [2023-11-06 22:53:01,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:01" (3/3) ... [2023-11-06 22:53:01,891 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-11-06 22:53:01,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:53:01,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:53:01,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:53:01,978 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@39ddf2b5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:53:01,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:53:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:53:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:53:01,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:01,994 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:01,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:01,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1238408432, now seen corresponding path program 1 times [2023-11-06 22:53:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:02,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623228309] [2023-11-06 22:53:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:53:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:53:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:53:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:53:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:53:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:53:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:53:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:53:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:53:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:53:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:53:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:53:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623228309] [2023-11-06 22:53:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623228309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:02,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:02,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:53:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994497617] [2023-11-06 22:53:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:53:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:53:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:53:02,515 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:53:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:02,545 INFO L93 Difference]: Finished difference Result 91 states and 144 transitions. [2023-11-06 22:53:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:53:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2023-11-06 22:53:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:02,556 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:53:02,556 INFO L226 Difference]: Without dead ends: 43 [2023-11-06 22:53:02,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:53:02,564 INFO L413 NwaCegarLoop]: 65 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, 65 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 [2023-11-06 22:53:02,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-06 22:53:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-06 22:53:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:53:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2023-11-06 22:53:02,611 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 76 [2023-11-06 22:53:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:02,611 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2023-11-06 22:53:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:53:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2023-11-06 22:53:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:53:02,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:02,617 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:53:02,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:02,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1029948370, now seen corresponding path program 1 times [2023-11-06 22:53:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519559562] [2023-11-06 22:53:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:02,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:02,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:02,968 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:53:02,970 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:53:02,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:53:02,976 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 22:53:02,980 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:53:03,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:53:03 BoogieIcfgContainer [2023-11-06 22:53:03,071 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:53:03,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:53:03,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:53:03,072 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:53:03,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:01" (3/4) ... [2023-11-06 22:53:03,075 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:53:03,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:53:03,078 INFO L158 Benchmark]: Toolchain (without parser) took 2173.44ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 70.3MB in the end (delta: 38.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2023-11-06 22:53:03,079 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:03,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.15ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 96.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:53:03,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 151.0MB. Free memory was 96.8MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:03,084 INFO L158 Benchmark]: Boogie Preprocessor took 56.80ms. Allocated memory is still 151.0MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:03,086 INFO L158 Benchmark]: RCFGBuilder took 525.55ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 123.2MB in the end (delta: -30.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:53:03,088 INFO L158 Benchmark]: TraceAbstraction took 1189.19ms. Allocated memory is still 151.0MB. Free memory was 122.8MB in the beginning and 70.7MB in the end (delta: 52.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-06 22:53:03,091 INFO L158 Benchmark]: Witness Printer took 5.27ms. Allocated memory is still 151.0MB. Free memory was 70.7MB in the beginning and 70.3MB in the end (delta: 390.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:03,095 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.34ms. Allocated memory is still 107.0MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.15ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 96.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 151.0MB. Free memory was 96.8MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.80ms. Allocated memory is still 151.0MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.55ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 123.2MB in the end (delta: -30.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1189.19ms. Allocated memory is still 151.0MB. Free memory was 122.8MB in the beginning and 70.7MB in the end (delta: 52.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 5.27ms. Allocated memory is still 151.0MB. Free memory was 70.7MB in the beginning and 70.3MB in the end (delta: 390.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] signed char var_1_10 = -64; [L24] unsigned char var_1_11 = 0; [L25] unsigned char var_1_12 = 0; [L26] unsigned char var_1_13 = 1; [L27] unsigned char var_1_14 = 0; [L28] unsigned char var_1_15 = 0; [L29] signed long int var_1_16 = -16; [L30] float var_1_17 = 3.5; [L31] float var_1_18 = 128.45; [L32] unsigned long int var_1_19 = 50; [L33] unsigned long int var_1_20 = 25; VAL [isInitial=0, var_1_10=-64, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L84] isInitial = 1 [L85] FCALL initially() [L86] int k_loop; [L87] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-64, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L87] COND TRUE k_loop < 1 [L88] FCALL updateLastVariables() [L89] CALL updateVariables() [L59] var_1_10 = __VERIFIER_nondet_char() [L60] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L60] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L62] var_1_12 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L63] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L65] var_1_14 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L66] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L68] var_1_15 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L69] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L71] var_1_18 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=25] [L72] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=25] [L73] var_1_20 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L74] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L75] CALL assume_abort_if_not(var_1_20 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L75] RET assume_abort_if_not(var_1_20 <= 4294967294) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=4294967299, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L89] RET updateVariables() [L90] CALL step() [L37] var_1_13 = (var_1_14 && var_1_15) [L38] var_1_17 = var_1_18 [L39] var_1_19 = var_1_20 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L40] COND TRUE (- (var_1_17 + var_1_17)) > var_1_17 [L41] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L43] var_1_16 = var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L44] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16 | var_1_19=4294967294, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L44] COND FALSE !(((var_1_16 | var_1_19) > var_1_16) && var_1_11) [L55] var_1_1 = var_1_10 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L90] RET step() [L91] CALL, EXPR property() [L80] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16 | var_1_19=4294967294, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L80-L81] return ((((((((var_1_16 | var_1_19) > var_1_16) && var_1_11) ? (((var_1_19 != -16) && (var_1_17 <= (var_1_17 + var_1_17))) ? ((var_1_17 > var_1_17) ? (var_1_1 == ((signed char) var_1_10)) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) && (((- (var_1_17 + var_1_17)) > var_1_17) ? (var_1_11 == ((unsigned char) var_1_12)) : 1)) && (var_1_13 == ((unsigned char) (var_1_14 && var_1_15)))) && (var_1_16 == ((signed long int) var_1_19))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((unsigned long int) var_1_20)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 65 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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 [2023-11-06 22:53:03,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:53:05,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:53:06,086 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:53:06,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:53:06,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:53:06,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:53:06,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:53:06,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:53:06,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:53:06,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:53:06,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:53:06,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:53:06,161 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:53:06,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:53:06,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:53:06,165 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:53:06,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:53:06,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:53:06,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:53:06,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:53:06,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:53:06,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:53:06,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:53:06,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:53:06,171 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:53:06,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:53:06,172 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:53:06,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:53:06,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:53:06,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:53:06,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:06,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:53:06,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:53:06,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:53:06,177 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:53:06,177 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:53:06,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:53:06,178 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:53:06,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:53:06,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:53:06,180 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:53:06,180 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:53:06,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 [2023-11-06 22:53:06,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:53:06,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:53:06,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:53:06,596 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:53:06,597 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:53:06,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-11-06 22:53:10,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:53:10,344 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:53:10,344 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-11-06 22:53:10,353 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data/676c13398/85ea2653de854a46a9616f5b02c94c4b/FLAG6e40e8996 [2023-11-06 22:53:10,369 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/data/676c13398/85ea2653de854a46a9616f5b02c94c4b [2023-11-06 22:53:10,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:53:10,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:53:10,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:10,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:53:10,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:53:10,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce23501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10, skipping insertion in model container [2023-11-06 22:53:10,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:53:10,584 WARN L240 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_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i[915,928] [2023-11-06 22:53:10,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:10,638 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:53:10,652 WARN L240 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_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i[915,928] [2023-11-06 22:53:10,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:10,694 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:53:10,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10 WrapperNode [2023-11-06 22:53:10,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:10,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:10,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:53:10,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:53:10,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,776 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-11-06 22:53:10,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:10,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:53:10,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:53:10,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:53:10,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:53:10,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:53:10,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:53:10,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:53:10,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:10,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:10,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:53:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:53:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:53:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:53:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:53:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:53:10,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:53:11,054 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:53:11,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:53:11,610 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:53:11,620 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:53:11,621 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:53:11,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:11 BoogieIcfgContainer [2023-11-06 22:53:11,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:53:11,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:53:11,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:53:11,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:53:11,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:10" (1/3) ... [2023-11-06 22:53:11,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d387165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:11, skipping insertion in model container [2023-11-06 22:53:11,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (2/3) ... [2023-11-06 22:53:11,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d387165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:11, skipping insertion in model container [2023-11-06 22:53:11,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:11" (3/3) ... [2023-11-06 22:53:11,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-11-06 22:53:11,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:53:11,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:53:11,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:53:11,733 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@79596c87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:53:11,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:53:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:53:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:53:11,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:11,755 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:11,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:11,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash -797935293, now seen corresponding path program 1 times [2023-11-06 22:53:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:53:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932997567] [2023-11-06 22:53:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:11,785 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 [2023-11-06 22:53:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:53:11,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:53:11,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:53:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:12,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:53:12,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 22:53:12,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:53:12,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:53:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932997567] [2023-11-06 22:53:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932997567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:12,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:12,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:53:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330653327] [2023-11-06 22:53:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:12,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:53:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:53:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:53:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:53:12,138 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:53:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:12,182 INFO L93 Difference]: Finished difference Result 81 states and 126 transitions. [2023-11-06 22:53:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:53:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2023-11-06 22:53:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:12,194 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:53:12,194 INFO L226 Difference]: Without dead ends: 38 [2023-11-06 22:53:12,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:53:12,205 INFO L413 NwaCegarLoop]: 55 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, 55 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 [2023-11-06 22:53:12,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-06 22:53:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-06 22:53:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:53:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2023-11-06 22:53:12,258 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 73 [2023-11-06 22:53:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:12,258 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2023-11-06 22:53:12,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:53:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2023-11-06 22:53:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:53:12,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:12,263 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:12,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:12,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:53:12,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:12,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1054580673, now seen corresponding path program 1 times [2023-11-06 22:53:12,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:53:12,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163198834] [2023-11-06 22:53:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:12,468 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 [2023-11-06 22:53:12,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:53:12,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:53:12,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:53:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:12,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:53:12,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:53:16,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:53:25,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:53:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163198834] [2023-11-06 22:53:25,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163198834] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:53:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-11-06 22:53:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031651072] [2023-11-06 22:53:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:25,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:53:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:53:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:53:25,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:53:25,056 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:53:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:32,912 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2023-11-06 22:53:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:53:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2023-11-06 22:53:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:32,918 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:53:32,918 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:53:32,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:53:32,921 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 86 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:32,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 224 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-06 22:53:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:53:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2023-11-06 22:53:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:53:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-11-06 22:53:32,942 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 73 [2023-11-06 22:53:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:32,943 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-11-06 22:53:32,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:53:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-11-06 22:53:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:53:32,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:32,946 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:32,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:33,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:53:33,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:33,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1465379261, now seen corresponding path program 1 times [2023-11-06 22:53:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:53:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154433485] [2023-11-06 22:53:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:33,164 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 [2023-11-06 22:53:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:53:33,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:53:33,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:53:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:33,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:53:33,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-06 22:53:37,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:47,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:53:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154433485] [2023-11-06 22:53:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154433485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [277522612] [2023-11-06 22:53:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:53:47,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:53:47,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:53:47,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-06 22:53:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:48,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:53:48,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:53:54,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:54:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:54:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [277522612] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:54:05,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:54:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2023-11-06 22:54:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697240960] [2023-11-06 22:54:05,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:54:05,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:54:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:54:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:54:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:54:05,976 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 6 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2023-11-06 22:54:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:54:26,003 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2023-11-06 22:54:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-06 22:54:26,007 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 6 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) Word has length 73 [2023-11-06 22:54:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:54:26,008 INFO L225 Difference]: With dead ends: 165 [2023-11-06 22:54:26,009 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:54:26,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=1035, Invalid=3795, Unknown=0, NotChecked=0, Total=4830 [2023-11-06 22:54:26,017 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 150 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:54:26,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 398 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2023-11-06 22:54:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:54:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:54:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:54:26,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2023-11-06 22:54:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:54:26,022 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:54:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 6 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2023-11-06 22:54:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:54:26,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:54:26,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:54:26,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:26,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:26,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:54:26,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:54:39,808 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-06 22:54:39,809 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,809 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,810 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:54:39,810 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:54:39,810 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (= ~var_1_1~0 ~var_1_10~0) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_19~0 ~var_1_20~0) (= ~var_1_17~0 ~var_1_18~0) (= ~var_1_19~0 ~var_1_16~0) (= ~var_1_11~0 (_ bv0 8)) (let ((.cse2 (= ~var_1_15~0 (_ bv0 8))) (.cse3 (= ~var_1_14~0 (_ bv0 8)))) (or (and (or .cse2 .cse3) (= ~var_1_13~0 (_ bv0 8))) (and (not .cse2) (not .cse3) (= (_ bv1 8) ~var_1_13~0)))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,810 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 78) no Hoare annotation was computed. [2023-11-06 22:54:39,811 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 56) no Hoare annotation was computed. [2023-11-06 22:54:39,811 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 83 95) the Hoare annotation is: true [2023-11-06 22:54:39,811 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-06 22:54:39,811 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2023-11-06 22:54:39,812 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,812 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,812 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 57) no Hoare annotation was computed. [2023-11-06 22:54:39,812 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:54:39,813 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-06 22:54:39,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:54:39,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:54:39,813 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 79 82) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 (= ~var_1_1~0 ~var_1_10~0)) (.cse3 (= |ULTIMATE.start_property_#res#1| (_ bv1 32))) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 (= ~var_1_19~0 ~var_1_20~0)) (.cse5 (= ~var_1_17~0 ~var_1_18~0)) (.cse6 (= ~var_1_19~0 ~var_1_16~0)) (.cse7 (= ~var_1_11~0 (_ bv0 8))) (.cse8 (let ((.cse11 (= ~var_1_15~0 (_ bv0 8))) (.cse12 (= ~var_1_14~0 (_ bv0 8)))) (or (and (or .cse11 .cse12) (= ~var_1_13~0 (_ bv0 8))) (and (not .cse11) (not .cse12) (= (_ bv1 8) ~var_1_13~0))))) (.cse9 (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (fp.leq ~var_1_18~0 .cse1) .cse2 .cse3 (fp.geq ~var_1_18~0 .cse0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-06 22:54:39,814 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-06 22:54:39,814 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,815 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,815 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-06 22:54:39,815 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,816 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse0)) (fp.geq ~var_1_18~0 (fp.neg .cse1))) (and (fp.leq ~var_1_18~0 .cse1) (fp.geq ~var_1_18~0 .cse0)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:54:39,816 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 87 93) no Hoare annotation was computed. [2023-11-06 22:54:39,816 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,817 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-06 22:54:39,817 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-06 22:54:39,817 INFO L899 garLoopResultBuilder]: For program point L75(lines 58 76) no Hoare annotation was computed. [2023-11-06 22:54:39,817 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:54:39,817 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-06 22:54:39,818 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 35) no Hoare annotation was computed. [2023-11-06 22:54:39,818 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,818 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,819 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 22:54:39,819 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-11-06 22:54:39,819 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:54:39,819 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:54:39,819 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:54:39,820 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:54:39,823 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:54:39,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:54:39,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,848 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:54:39 BoogieIcfgContainer [2023-11-06 22:54:39,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:54:39,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:54:39,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:54:39,852 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:54:39,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:11" (3/4) ... [2023-11-06 22:54:39,854 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:54:39,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:54:39,864 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:54:39,864 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:54:39,865 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:54:39,865 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:54:39,894 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((var_1_1 == var_1_10) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0)) || ((((((((var_1_1 == var_1_10) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0))) [2023-11-06 22:54:39,894 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((cond == 1) && (var_1_1 == var_1_10)) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0)) [2023-11-06 22:54:39,918 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((var_1_1 == var_1_10) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0)) || ((((((((var_1_1 == var_1_10) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0))) [2023-11-06 22:54:39,919 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((cond == 1) && (var_1_1 == var_1_10)) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0)) [2023-11-06 22:54:39,930 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:54:39,931 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:54:39,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:54:39,932 INFO L158 Benchmark]: Toolchain (without parser) took 89558.55ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 68.7MB in the beginning and 92.5MB in the end (delta: -23.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-06 22:54:39,932 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 62.9MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:54:39,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.14ms. Allocated memory is still 92.3MB. Free memory was 68.4MB in the beginning and 56.2MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:54:39,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.57ms. Allocated memory is still 92.3MB. Free memory was 56.2MB in the beginning and 54.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:54:39,933 INFO L158 Benchmark]: Boogie Preprocessor took 66.34ms. Allocated memory is still 92.3MB. Free memory was 54.2MB in the beginning and 52.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:54:39,934 INFO L158 Benchmark]: RCFGBuilder took 779.08ms. Allocated memory is still 92.3MB. Free memory was 52.5MB in the beginning and 63.9MB in the end (delta: -11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:54:39,934 INFO L158 Benchmark]: TraceAbstraction took 88223.94ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 63.4MB in the beginning and 96.7MB in the end (delta: -33.4MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2023-11-06 22:54:39,935 INFO L158 Benchmark]: Witness Printer took 79.85ms. Allocated memory is still 134.2MB. Free memory was 96.7MB in the beginning and 92.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:54:39,937 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.34ms. Allocated memory is still 62.9MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.14ms. Allocated memory is still 92.3MB. Free memory was 68.4MB in the beginning and 56.2MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.57ms. Allocated memory is still 92.3MB. Free memory was 56.2MB in the beginning and 54.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.34ms. Allocated memory is still 92.3MB. Free memory was 54.2MB in the beginning and 52.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 779.08ms. Allocated memory is still 92.3MB. Free memory was 52.5MB in the beginning and 63.9MB in the end (delta: -11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 88223.94ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 63.4MB in the beginning and 96.7MB in the end (delta: -33.4MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 79.85ms. Allocated memory is still 134.2MB. Free memory was 96.7MB in the beginning and 92.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 88.1s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 15.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 677 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1103 IncrementalHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 181 mSDtfsCounter, 1103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 32.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 76 PreInvPairs, 110 NumberOfFragments, 847 HoareAnnotationTreeSize, 76 FomulaSimplifications, 452 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 3884 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 44.7s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 3109 SizeOfPredicates, 62 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1278/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 79]: Loop Invariant [2023-11-06 22:54:39,948 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,949 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,950 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,951 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: (((((((((var_1_1 == var_1_10) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0)) || ((((((((var_1_1 == var_1_10) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0))) - InvariantResult [Line: 87]: Loop Invariant [2023-11-06 22:54:39,952 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,952 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,953 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,953 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,954 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-11-06 22:54:39,954 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: ((var_1_11 == 0) && (var_1_12 <= 0)) - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 22:54:39,955 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 22:54:39,956 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: (((((((((cond == 1) && (var_1_1 == var_1_10)) && (\result == 1)) && (var_1_19 == var_1_20)) && (var_1_17 == var_1_18)) && (var_1_19 == var_1_16)) && (var_1_11 == 0)) && ((((var_1_15 == 0) || (var_1_14 == 0)) && (var_1_13 == 0)) || ((!((var_1_15 == 0)) && !((var_1_14 == 0))) && (1 == var_1_13)))) && (var_1_12 <= 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:54:40,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8041a645-f0c6-4d9e-80d3-e0fb0a7533d8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE