./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:04:57,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:04:57,406 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:04:57,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:04:57,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:04:57,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:04:57,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:04:57,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:04:57,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:04:57,440 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:04:57,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:04:57,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:04:57,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:04:57,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:04:57,443 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:04:57,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:04:57,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:04:57,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:04:57,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:04:57,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:04:57,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:04:57,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:04:57,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:04:57,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:04:57,449 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:04:57,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:04:57,450 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:04:57,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:04:57,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:04:57,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:04:57,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:04:57,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:04:57,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:04:57,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:04:57,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:04:57,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:04:57,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:04:57,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:04:57,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:04:57,454 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:04:57,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:04:57,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:04:57,455 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2023-11-29 04:04:57,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:04:57,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:04:57,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:04:57,691 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:04:57,692 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:04:57,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-29 04:05:00,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:05:00,654 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:05:00,654 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-29 04:05:00,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data/5858e8fe3/c5427741fe4b46309a5536f82c60ad7b/FLAG889ef6dce [2023-11-29 04:05:00,674 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data/5858e8fe3/c5427741fe4b46309a5536f82c60ad7b [2023-11-29 04:05:00,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:05:00,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:05:00,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:05:00,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:05:00,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:05:00,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbbea06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00, skipping insertion in model container [2023-11-29 04:05:00,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,709 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:05:00,829 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-29 04:05:00,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:05:00,864 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:05:00,875 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-29 04:05:00,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:05:00,898 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:05:00,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00 WrapperNode [2023-11-29 04:05:00,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:05:00,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:05:00,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:05:00,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:05:00,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,936 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-11-29 04:05:00,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:05:00,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:05:00,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:05:00,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:05:00,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:05:00,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:05:00,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:05:00,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:05:00,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:05:00,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (1/1) ... [2023-11-29 04:05:00,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:05:00,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:05:01,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:05:01,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:05:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:05:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:05:01,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:05:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:05:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:05:01,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:05:01,110 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:05:01,112 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:05:01,295 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:05:01,338 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:05:01,338 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:05:01,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:01 BoogieIcfgContainer [2023-11-29 04:05:01,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:05:01,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:05:01,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:05:01,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:05:01,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:05:00" (1/3) ... [2023-11-29 04:05:01,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3a7b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:05:01, skipping insertion in model container [2023-11-29 04:05:01,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:00" (2/3) ... [2023-11-29 04:05:01,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3a7b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:05:01, skipping insertion in model container [2023-11-29 04:05:01,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:01" (3/3) ... [2023-11-29 04:05:01,348 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2023-11-29 04:05:01,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:05:01,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:05:01,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:05:01,414 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62c4aa57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:05:01,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:05:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:05:01,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:01,428 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 04:05:01,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:01,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1998943782, now seen corresponding path program 1 times [2023-11-29 04:05:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:01,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959427235] [2023-11-29 04:05:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:05:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:05:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:05:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:05:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959427235] [2023-11-29 04:05:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959427235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:01,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:01,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:05:01,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317057676] [2023-11-29 04:05:01,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:01,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:05:01,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:05:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:05:01,733 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:05:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:01,764 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2023-11-29 04:05:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:05:01,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-11-29 04:05:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:01,772 INFO L225 Difference]: With dead ends: 67 [2023-11-29 04:05:01,773 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:05:01,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-29 04:05:01,779 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:01,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:05:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 04:05:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2023-11-29 04:05:01,815 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 59 [2023-11-29 04:05:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2023-11-29 04:05:01,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:05:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2023-11-29 04:05:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:05:01,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:01,820 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 04:05:01,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:05:01,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:01,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2054572968, now seen corresponding path program 1 times [2023-11-29 04:05:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186107042] [2023-11-29 04:05:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:05:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:05:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:05:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:05:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186107042] [2023-11-29 04:05:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186107042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:02,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:05:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479469357] [2023-11-29 04:05:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:02,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:05:02,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:02,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:05:02,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:05:02,012 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:02,041 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2023-11-29 04:05:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:05:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-11-29 04:05:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:02,044 INFO L225 Difference]: With dead ends: 66 [2023-11-29 04:05:02,044 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 04:05:02,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:05:02,047 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:02,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 04:05:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-29 04:05:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2023-11-29 04:05:02,057 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 59 [2023-11-29 04:05:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:02,058 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2023-11-29 04:05:02,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2023-11-29 04:05:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:05:02,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:02,061 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 04:05:02,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:05:02,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:02,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -420585463, now seen corresponding path program 1 times [2023-11-29 04:05:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582892273] [2023-11-29 04:05:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:05:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:05:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:05:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:05:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:02,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582892273] [2023-11-29 04:05:02,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582892273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:02,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:02,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:05:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414537145] [2023-11-29 04:05:02,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:02,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:05:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:02,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:05:02,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:05:02,334 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:02,425 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2023-11-29 04:05:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:05:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-29 04:05:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:02,427 INFO L225 Difference]: With dead ends: 77 [2023-11-29 04:05:02,427 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 04:05:02,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:05:02,429 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:02,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 135 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:05:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 04:05:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2023-11-29 04:05:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2023-11-29 04:05:02,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 60 [2023-11-29 04:05:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:02,439 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2023-11-29 04:05:02,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2023-11-29 04:05:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:05:02,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:02,441 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 04:05:02,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:05:02,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -399092064, now seen corresponding path program 1 times [2023-11-29 04:05:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602991935] [2023-11-29 04:05:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:05:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:05:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:05:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:05:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:05:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:05:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:05:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:05:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:05:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602991935] [2023-11-29 04:05:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602991935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:05:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853506428] [2023-11-29 04:05:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:02,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:05:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:05:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:05:02,532 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:02,578 INFO L93 Difference]: Finished difference Result 95 states and 135 transitions. [2023-11-29 04:05:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:05:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-29 04:05:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:02,580 INFO L225 Difference]: With dead ends: 95 [2023-11-29 04:05:02,580 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 04:05:02,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:05:02,582 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:02,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 04:05:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2023-11-29 04:05:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2023-11-29 04:05:02,591 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 60 [2023-11-29 04:05:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:02,592 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2023-11-29 04:05:02,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2023-11-29 04:05:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 04:05:02,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:02,593 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 04:05:02,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:05:02,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:02,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1045823539, now seen corresponding path program 1 times [2023-11-29 04:05:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:02,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101461782] [2023-11-29 04:05:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:05:02,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:05:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:05:02,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:05:02,661 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:05:02,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:05:02,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:05:02,667 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 04:05:02,671 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:05:02,699 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:05:02,700 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-29 04:05:02,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:05:02 BoogieIcfgContainer [2023-11-29 04:05:02,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:05:02,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:05:02,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:05:02,712 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:05:02,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:01" (3/4) ... [2023-11-29 04:05:02,715 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:05:02,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:05:02,716 INFO L158 Benchmark]: Toolchain (without parser) took 2037.85ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 109.3MB in the beginning and 97.9MB in the end (delta: 11.4MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2023-11-29 04:05:02,717 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:05:02,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.24ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 98.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:05:02,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.82ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:05:02,718 INFO L158 Benchmark]: Boogie Preprocessor took 41.40ms. Allocated memory is still 155.2MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:05:02,718 INFO L158 Benchmark]: RCFGBuilder took 359.87ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 79.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:05:02,719 INFO L158 Benchmark]: TraceAbstraction took 1369.62ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 79.0MB in the beginning and 97.9MB in the end (delta: -18.9MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2023-11-29 04:05:02,719 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 213.9MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:05:02,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.24ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 98.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.82ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.40ms. Allocated memory is still 155.2MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.87ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 79.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1369.62ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 79.0MB in the beginning and 97.9MB in the end (delta: -18.9MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 213.9MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.25; [L23] signed short int var_1_2 = -25; [L24] signed short int var_1_3 = -500; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 0; [L27] double var_1_6 = 127.25; [L64] isInitial = 1 [L65] FCALL initially() [L66] COND TRUE 1 [L67] FCALL updateLastVariables() [L68] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_short() [L43] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L43] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L45] var_1_3 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L46] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_5=0, var_1_6=509/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_5=0, var_1_6=509/4] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_6=509/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_6=509/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L55] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L68] RET updateVariables() [L69] CALL step() [L31] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L31] COND TRUE (var_1_2 & var_1_3) >= -64 [L32] COND TRUE var_1_2 > var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1] [L33] COND TRUE (var_1_2 > var_1_3) && (var_1_4 || var_1_5) [L34] var_1_1 = var_1_6 VAL [isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] [L69] RET step() [L70] CALL, EXPR property() [L60] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] [L60-L61] return ((var_1_2 & var_1_3) >= -64) ? ((var_1_2 > var_1_3) ? (((var_1_2 > var_1_3) && (var_1_4 || var_1_5)) ? (var_1_1 == ((double) var_1_6)) : (var_1_1 == ((double) var_1_6))) : 1) : 1 ; [L70] RET, EXPR property() [L70] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=132, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=132] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 177 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, InterpolantAutomatonStates: 13, 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, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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-29 04:05:02,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:05:04,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:05:04,816 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:05:04,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:05:04,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:05:04,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:05:04,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:05:04,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:05:04,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:05:04,862 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:05:04,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:05:04,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:05:04,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:05:04,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:05:04,866 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:05:04,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:05:04,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:05:04,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:05:04,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:05:04,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:05:04,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:05:04,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:05:04,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:05:04,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:05:04,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:05:04,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:05:04,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:05:04,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:05:04,872 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:05:04,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:05:04,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:05:04,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:05:04,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:05:04,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:05:04,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:05:04,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:05:04,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:05:04,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:05:04,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:05:04,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:05:04,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:05:04,876 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:05:04,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:05:04,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:05:04,876 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:05:04,876 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2023-11-29 04:05:05,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:05:05,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:05:05,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:05:05,208 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:05:05,208 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:05:05,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-29 04:05:08,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:05:08,342 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:05:08,342 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-29 04:05:08,350 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data/ab8038285/dd4fac7a52ad437eb820ab177121e7c9/FLAGfe88eb309 [2023-11-29 04:05:08,367 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/data/ab8038285/dd4fac7a52ad437eb820ab177121e7c9 [2023-11-29 04:05:08,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:05:08,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:05:08,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:05:08,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:05:08,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:05:08,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@970501b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08, skipping insertion in model container [2023-11-29 04:05:08,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,402 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:05:08,537 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-29 04:05:08,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:05:08,582 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:05:08,593 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_6c888491-9ac2-4e72-9e0b-faa286b943a5/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-29 04:05:08,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:05:08,621 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:05:08,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08 WrapperNode [2023-11-29 04:05:08,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:05:08,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:05:08,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:05:08,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:05:08,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,661 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2023-11-29 04:05:08,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:05:08,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:05:08,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:05:08,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:05:08,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:05:08,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:05:08,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:05:08,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:05:08,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:05:08,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (1/1) ... [2023-11-29 04:05:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:05:08,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:05:08,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:05:08,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:05:08,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:05:08,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:05:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:05:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:05:08,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:05:08,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:05:08,843 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:05:08,845 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:05:09,045 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:05:09,084 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:05:09,084 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:05:09,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:09 BoogieIcfgContainer [2023-11-29 04:05:09,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:05:09,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:05:09,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:05:09,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:05:09,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:05:08" (1/3) ... [2023-11-29 04:05:09,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c314b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:05:09, skipping insertion in model container [2023-11-29 04:05:09,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:05:08" (2/3) ... [2023-11-29 04:05:09,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c314b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:05:09, skipping insertion in model container [2023-11-29 04:05:09,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:09" (3/3) ... [2023-11-29 04:05:09,093 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2023-11-29 04:05:09,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:05:09,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:05:09,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:05:09,165 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d6f407a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:05:09,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:05:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 04:05:09,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:09,180 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 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-29 04:05:09,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:09,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1094518549, now seen corresponding path program 1 times [2023-11-29 04:05:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:05:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942322547] [2023-11-29 04:05:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:09,199 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-29 04:05:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:05:09,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:09,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:09,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:05:09,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 04:05:09,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:05:09,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:05:09,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942322547] [2023-11-29 04:05:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942322547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:05:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205497975] [2023-11-29 04:05:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:09,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:05:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:05:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:05:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:05:09,395 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:05:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:09,428 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2023-11-29 04:05:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:05:09,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2023-11-29 04:05:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:09,439 INFO L225 Difference]: With dead ends: 57 [2023-11-29 04:05:09,439 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 04:05:09,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 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-29 04:05:09,445 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:09,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 04:05:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 04:05:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-11-29 04:05:09,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 56 [2023-11-29 04:05:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:09,488 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-11-29 04:05:09,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:05:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-11-29 04:05:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 04:05:09,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:09,492 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 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-29 04:05:09,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:09,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:09,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:09,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1068753577, now seen corresponding path program 1 times [2023-11-29 04:05:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:05:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857666623] [2023-11-29 04:05:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:09,697 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-29 04:05:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:05:09,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:09,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:09,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:05:09,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:09,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:05:09,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:05:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857666623] [2023-11-29 04:05:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857666623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:05:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98155206] [2023-11-29 04:05:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:09,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:05:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:05:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:05:09,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:05:09,998 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:10,063 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2023-11-29 04:05:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:05:10,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 56 [2023-11-29 04:05:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:10,065 INFO L225 Difference]: With dead ends: 34 [2023-11-29 04:05:10,066 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 04:05:10,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:05:10,068 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:10,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:05:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 04:05:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-11-29 04:05:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-29 04:05:10,078 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 56 [2023-11-29 04:05:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:10,079 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-29 04:05:10,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-29 04:05:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 04:05:10,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:10,082 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 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-29 04:05:10,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:05:10,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:10,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:10,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1242959701, now seen corresponding path program 1 times [2023-11-29 04:05:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:05:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703234404] [2023-11-29 04:05:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:10,286 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-29 04:05:10,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:05:10,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:10,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:10,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:05:10,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 04:05:10,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:05:10,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:05:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703234404] [2023-11-29 04:05:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703234404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:10,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:05:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325743477] [2023-11-29 04:05:10,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:10,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:05:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:05:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:05:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:05:10,462 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:10,570 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-11-29 04:05:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:05:10,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 57 [2023-11-29 04:05:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:10,572 INFO L225 Difference]: With dead ends: 38 [2023-11-29 04:05:10,573 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 04:05:10,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:05:10,574 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:10,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 112 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:05:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 04:05:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-11-29 04:05:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:05:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-29 04:05:10,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 57 [2023-11-29 04:05:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:10,584 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-29 04:05:10,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-29 04:05:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:05:10,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:10,586 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-29 04:05:10,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:10,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:10,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:10,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 113764884, now seen corresponding path program 1 times [2023-11-29 04:05:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:05:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588631625] [2023-11-29 04:05:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:10,794 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-29 04:05:10,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:05:10,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:10,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:05:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:10,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:05:10,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 04:05:11,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:05:11,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:05:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588631625] [2023-11-29 04:05:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588631625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:05:11,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:05:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:05:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550848822] [2023-11-29 04:05:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:05:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:05:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:05:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:05:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:05:11,499 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:12,498 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-29 04:05:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:05:12,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-29 04:05:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:12,500 INFO L225 Difference]: With dead ends: 42 [2023-11-29 04:05:12,500 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:05:12,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:05:12,502 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:12,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 78 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:05:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:05:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:05:12,504 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-29 04:05:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:05:12,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2023-11-29 04:05:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:12,505 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:05:12,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 04:05:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:05:12,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:05:12,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:05:12,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:05:12,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:05:12,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:05:13,102 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 39) no Hoare annotation was computed. [2023-11-29 04:05:13,103 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,103 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,103 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:05:13,103 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:05:13,103 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:05:13,103 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-29 04:05:13,103 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 38) no Hoare annotation was computed. [2023-11-29 04:05:13,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:05:13,104 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-29 04:05:13,104 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,104 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,104 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-11-29 04:05:13,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:05:13,104 INFO L895 garLoopResultBuilder]: At program point L66-2(lines 66 72) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,105 INFO L899 garLoopResultBuilder]: For program point L66-3(lines 66 72) no Hoare annotation was computed. [2023-11-29 04:05:13,105 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-29 04:05:13,105 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,105 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,105 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:05:13,105 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 40) no Hoare annotation was computed. [2023-11-29 04:05:13,105 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-11-29 04:05:13,106 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 41 56) no Hoare annotation was computed. [2023-11-29 04:05:13,106 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-29 04:05:13,106 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,106 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:05:13,106 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:05:13,106 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:05:13,106 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:05:13,107 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:05:13,109 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 04:05:13,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:05:13,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 04:05:13,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 04:05:13,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 04:05:13,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 04:05:13,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 04:05:13,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:05:13 BoogieIcfgContainer [2023-11-29 04:05:13,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:05:13,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:05:13,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:05:13,122 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:05:13,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:05:09" (3/4) ... [2023-11-29 04:05:13,124 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:05:13,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:05:13,130 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 04:05:13,130 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 04:05:13,130 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:05:13,131 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:05:13,213 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:05:13,214 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:05:13,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:05:13,214 INFO L158 Benchmark]: Toolchain (without parser) took 4843.06ms. Allocated memory is still 113.2MB. Free memory was 90.0MB in the beginning and 54.6MB in the end (delta: 35.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2023-11-29 04:05:13,214 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 67.1MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:05:13,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.18ms. Allocated memory is still 113.2MB. Free memory was 89.8MB in the beginning and 78.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:05:13,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.51ms. Allocated memory is still 113.2MB. Free memory was 78.1MB in the beginning and 76.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:05:13,215 INFO L158 Benchmark]: Boogie Preprocessor took 44.70ms. Allocated memory is still 113.2MB. Free memory was 76.3MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:05:13,216 INFO L158 Benchmark]: RCFGBuilder took 376.32ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 86.8MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:05:13,216 INFO L158 Benchmark]: TraceAbstraction took 4034.14ms. Allocated memory is still 113.2MB. Free memory was 86.3MB in the beginning and 59.6MB in the end (delta: 26.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-11-29 04:05:13,216 INFO L158 Benchmark]: Witness Printer took 92.20ms. Allocated memory is still 113.2MB. Free memory was 58.8MB in the beginning and 54.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:05:13,218 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.26ms. Allocated memory is still 67.1MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.18ms. Allocated memory is still 113.2MB. Free memory was 89.8MB in the beginning and 78.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.51ms. Allocated memory is still 113.2MB. Free memory was 78.1MB in the beginning and 76.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.70ms. Allocated memory is still 113.2MB. Free memory was 76.3MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.32ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 86.8MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4034.14ms. Allocated memory is still 113.2MB. Free memory was 86.3MB in the beginning and 59.6MB in the end (delta: 26.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 92.20ms. Allocated memory is still 113.2MB. Free memory was 58.8MB in the beginning and 54.6MB 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: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 126 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 28 PreInvPairs, 40 NumberOfFragments, 337 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 262 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 566 SizeOfPredicates, 23 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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: 66]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 04:05:13,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c888491-9ac2-4e72-9e0b-faa286b943a5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE