./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:56:31,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:56:31,143 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:56:31,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:56:31,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:56:31,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:56:31,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:56:31,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:56:31,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:56:31,173 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:56:31,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:56:31,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:56:31,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:56:31,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:56:31,176 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:56:31,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:56:31,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:56:31,178 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:56:31,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:56:31,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:56:31,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:56:31,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:56:31,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:56:31,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:56:31,181 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:56:31,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:56:31,182 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:56:31,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:56:31,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:56:31,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:56:31,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:56:31,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:56:31,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:56:31,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:56:31,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:56:31,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:56:31,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:56:31,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:56:31,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:56:31,186 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:56:31,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:56:31,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:56:31,186 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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 -> 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce [2023-11-29 01:56:31,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:56:31,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:56:31,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:56:31,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:56:31,444 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:56:31,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2023-11-29 01:56:34,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:56:34,369 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:56:34,369 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2023-11-29 01:56:34,380 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data/62792fec5/8ba460af178a43128a975723e55882e1/FLAG9c22a4b0d [2023-11-29 01:56:34,739 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data/62792fec5/8ba460af178a43128a975723e55882e1 [2023-11-29 01:56:34,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:56:34,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:56:34,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:56:34,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:56:34,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:56:34,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:34,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a429ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34, skipping insertion in model container [2023-11-29 01:56:34,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:34,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:56:34,889 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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2023-11-29 01:56:34,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:56:34,945 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:56:34,958 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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2023-11-29 01:56:34,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:56:34,998 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:56:34,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34 WrapperNode [2023-11-29 01:56:34,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:56:35,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:56:35,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:56:35,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:56:35,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,048 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2023-11-29 01:56:35,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:56:35,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:56:35,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:56:35,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:56:35,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,080 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 01:56:35,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:56:35,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:56:35,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:56:35,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:56:35,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (1/1) ... [2023-11-29 01:56:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:56:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:56:35,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:56:35,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:56:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:56:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:56:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:56:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:56:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:56:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:56:35,239 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:56:35,241 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:56:35,466 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:56:35,501 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:56:35,502 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:56:35,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:35 BoogieIcfgContainer [2023-11-29 01:56:35,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:56:35,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:56:35,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:56:35,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:56:35,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:56:34" (1/3) ... [2023-11-29 01:56:35,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60447f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:56:35, skipping insertion in model container [2023-11-29 01:56:35,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:34" (2/3) ... [2023-11-29 01:56:35,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60447f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:56:35, skipping insertion in model container [2023-11-29 01:56:35,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:35" (3/3) ... [2023-11-29 01:56:35,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-11.i [2023-11-29 01:56:35,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:56:35,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:56:35,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:56:35,577 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;@339c071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:56:35,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:56:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:56:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:56:35,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:35,592 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:35,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:35,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:35,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1788450943, now seen corresponding path program 1 times [2023-11-29 01:56:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:35,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331877553] [2023-11-29 01:56:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:56:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:56:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:56:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:56:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 01:56:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 01:56:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:56:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:56:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:56:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:56:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:56:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:56:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:56:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 01:56:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 01:56:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:56:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:56:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:56:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331877553] [2023-11-29 01:56:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331877553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:56:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542564636] [2023-11-29 01:56:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:35,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:56:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:56:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:56:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:56:35,994 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:56:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:56:36,032 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2023-11-29 01:56:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:56:36,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2023-11-29 01:56:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:56:36,041 INFO L225 Difference]: With dead ends: 93 [2023-11-29 01:56:36,041 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 01:56:36,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 01:56:36,049 INFO L413 NwaCegarLoop]: 66 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, 66 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 01:56:36,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:56:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 01:56:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 01:56:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:56:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2023-11-29 01:56:36,091 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 100 [2023-11-29 01:56:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:56:36,091 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2023-11-29 01:56:36,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:56:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2023-11-29 01:56:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:56:36,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:36,097 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:36,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:56:36,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:36,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1112841215, now seen corresponding path program 1 times [2023-11-29 01:56:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759061390] [2023-11-29 01:56:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:56:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:56:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:56:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:56:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 01:56:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 01:56:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:56:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:56:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:56:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:56:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:56:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:56:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:56:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 01:56:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 01:56:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:56:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:56:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:56:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759061390] [2023-11-29 01:56:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759061390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:36,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:36,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:56:36,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989350784] [2023-11-29 01:56:36,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:36,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:56:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:56:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:56:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:56:36,453 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:56:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:56:36,502 INFO L93 Difference]: Finished difference Result 136 states and 205 transitions. [2023-11-29 01:56:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:56:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-11-29 01:56:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:56:36,506 INFO L225 Difference]: With dead ends: 136 [2023-11-29 01:56:36,506 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 01:56:36,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 01:56:36,509 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:56:36,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:56:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 01:56:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2023-11-29 01:56:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 01:56:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2023-11-29 01:56:36,536 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 100 [2023-11-29 01:56:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:56:36,537 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2023-11-29 01:56:36,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:56:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2023-11-29 01:56:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:56:36,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:36,540 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:36,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:56:36,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:36,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1112900797, now seen corresponding path program 1 times [2023-11-29 01:56:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393598989] [2023-11-29 01:56:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:56:36,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:56:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:56:36,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:56:36,726 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:56:36,727 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:56:36,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:56:36,733 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 01:56:36,736 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:56:36,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:56:36 BoogieIcfgContainer [2023-11-29 01:56:36,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:56:36,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:56:36,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:56:36,799 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:56:36,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:35" (3/4) ... [2023-11-29 01:56:36,802 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:56:36,803 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:56:36,804 INFO L158 Benchmark]: Toolchain (without parser) took 2061.50ms. Allocated memory was 146.8MB in the beginning and 180.4MB in the end (delta: 33.6MB). Free memory was 106.1MB in the beginning and 133.6MB in the end (delta: -27.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2023-11-29 01:56:36,804 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:56:36,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.04ms. Allocated memory is still 146.8MB. Free memory was 106.1MB in the beginning and 93.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:56:36,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.43ms. Allocated memory is still 146.8MB. Free memory was 93.3MB in the beginning and 90.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:56:36,806 INFO L158 Benchmark]: Boogie Preprocessor took 51.43ms. Allocated memory is still 146.8MB. Free memory was 90.3MB in the beginning and 85.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:56:36,806 INFO L158 Benchmark]: RCFGBuilder took 401.46ms. Allocated memory is still 146.8MB. Free memory was 85.3MB in the beginning and 66.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 01:56:36,807 INFO L158 Benchmark]: TraceAbstraction took 1293.88ms. Allocated memory was 146.8MB in the beginning and 180.4MB in the end (delta: 33.6MB). Free memory was 66.3MB in the beginning and 133.6MB in the end (delta: -67.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:56:36,807 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 180.4MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:56:36,810 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.19ms. Allocated memory is still 146.8MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.04ms. Allocated memory is still 146.8MB. Free memory was 106.1MB in the beginning and 93.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.43ms. Allocated memory is still 146.8MB. Free memory was 93.3MB in the beginning and 90.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.43ms. Allocated memory is still 146.8MB. Free memory was 90.3MB in the beginning and 85.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 401.46ms. Allocated memory is still 146.8MB. Free memory was 85.3MB in the beginning and 66.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1293.88ms. Allocated memory was 146.8MB in the beginning and 180.4MB in the end (delta: 33.6MB). Free memory was 66.3MB in the beginning and 133.6MB in the end (delta: -67.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 180.4MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] double var_1_3 = 7.675; [L25] signed char var_1_7 = 10; [L26] float var_1_8 = 32.5; [L27] float var_1_9 = 1000000.7; [L28] float var_1_10 = 2.4; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 200; [L34] unsigned char var_1_16 = 10; [L35] unsigned char var_1_17 = 1; [L36] unsigned char last_1_var_1_11 = 1; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_11 = var_1_11 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] var_1_3 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L73] var_1_7 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L75] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L75] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2, var_1_9=10000007/10] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L78] var_1_10 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L79] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L80] var_1_12 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L86] var_1_15 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L87] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L88] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L89] var_1_16 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L90] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L91] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=1, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L92] var_1_17 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L93] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L94] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L94] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L108] RET updateVariables() [L109] CALL step() [L40] COND FALSE !(var_1_3 >= var_1_2) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L49] COND FALSE !(var_1_8 <= var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L52] unsigned char stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L53] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L62] COND FALSE !(! var_1_11) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=254, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_11 && var_1_11) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((var_1_3 >= var_1_2) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? (var_1_8 == ((float) ((((var_1_9) > ((10.25f + var_1_10))) ? (var_1_9) : ((10.25f + var_1_10)))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && ((var_1_8 <= var_1_8) ? (var_1_11 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && ((! var_1_11) ? (var_1_14 == ((unsigned char) ((((((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) < (var_1_17)) ? (((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_16))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=254, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=254, var_1_15=254, var_1_16=254, var_1_17=253, var_1_1=-16, var_1_7=-127, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 128 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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 01:56:36,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:56:38,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:56:38,831 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:56:38,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:56:38,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:56:38,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:56:38,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:56:38,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:56:38,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:56:38,879 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:56:38,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:56:38,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:56:38,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:56:38,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:56:38,882 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:56:38,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:56:38,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:56:38,884 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:56:38,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:56:38,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:56:38,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:56:38,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:56:38,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:56:38,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:56:38,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:56:38,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:56:38,888 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:56:38,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:56:38,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:56:38,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:56:38,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:56:38,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:56:38,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:56:38,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:56:38,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:56:38,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:56:38,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:56:38,891 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:56:38,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:56:38,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:56:38,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:56:38,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:56:38,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:56:38,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:56:38,893 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:56:38,893 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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 -> 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce [2023-11-29 01:56:39,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:56:39,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:56:39,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:56:39,235 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:56:39,235 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:56:39,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2023-11-29 01:56:41,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:56:42,210 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:56:42,211 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2023-11-29 01:56:42,220 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data/e9b8edbc9/f7fbde177d724ec78a7d916fa73d694d/FLAG96d049f37 [2023-11-29 01:56:42,548 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/data/e9b8edbc9/f7fbde177d724ec78a7d916fa73d694d [2023-11-29 01:56:42,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:56:42,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:56:42,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:56:42,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:56:42,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:56:42,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3813d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42, skipping insertion in model container [2023-11-29 01:56:42,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:56:42,748 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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2023-11-29 01:56:42,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:56:42,810 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:56:42,823 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_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2023-11-29 01:56:42,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:56:42,864 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:56:42,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42 WrapperNode [2023-11-29 01:56:42,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:56:42,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:56:42,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:56:42,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:56:42,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,912 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2023-11-29 01:56:42,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:56:42,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:56:42,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:56:42,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:56:42,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,943 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 01:56:42,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:56:42,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:56:42,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:56:42,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:56:42,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (1/1) ... [2023-11-29 01:56:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:56:42,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:56:42,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:56:42,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:56:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:56:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:56:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:56:43,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:56:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:56:43,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:56:43,123 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:56:43,126 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:56:55,708 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:56:55,748 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:56:55,749 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:56:55,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:55 BoogieIcfgContainer [2023-11-29 01:56:55,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:56:55,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:56:55,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:56:55,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:56:55,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:56:42" (1/3) ... [2023-11-29 01:56:55,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241b55e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:56:55, skipping insertion in model container [2023-11-29 01:56:55,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:42" (2/3) ... [2023-11-29 01:56:55,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241b55e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:56:55, skipping insertion in model container [2023-11-29 01:56:55,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:55" (3/3) ... [2023-11-29 01:56:55,759 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-11.i [2023-11-29 01:56:55,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:56:55,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:56:55,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:56:55,829 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;@311855e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:56:55,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:56:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:56:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:56:55,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:55,846 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:55,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:55,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1788450943, now seen corresponding path program 1 times [2023-11-29 01:56:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:56:55,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282925618] [2023-11-29 01:56:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:55,866 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 01:56:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:56:55,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:56:55,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:56:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:56,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:56:56,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-11-29 01:56:56,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:56:56,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:56:56,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282925618] [2023-11-29 01:56:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282925618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:56,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:56,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:56:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027056896] [2023-11-29 01:56:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:56,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:56:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:56:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:56:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:56:56,514 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:57:00,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:57:00,781 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2023-11-29 01:57:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:57:00,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2023-11-29 01:57:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:57:00,865 INFO L225 Difference]: With dead ends: 93 [2023-11-29 01:57:00,865 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 01:57:00,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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 01:57:00,871 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:57:00,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 01:57:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 01:57:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 01:57:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:57:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2023-11-29 01:57:00,918 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 100 [2023-11-29 01:57:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:57:00,918 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2023-11-29 01:57:00,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:57:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2023-11-29 01:57:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:57:00,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:57:00,923 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:57:00,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:01,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:01,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:57:01,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:57:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1112841215, now seen corresponding path program 1 times [2023-11-29 01:57:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:57:01,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868877892] [2023-11-29 01:57:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:57:01,126 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 01:57:01,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:57:01,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:01,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:57:01,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:57:01,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:57:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:57:02,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:57:02,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:57:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868877892] [2023-11-29 01:57:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868877892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:57:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:57:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:57:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462563992] [2023-11-29 01:57:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:57:02,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:57:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:57:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:57:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:57:02,862 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:57:07,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:11,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:15,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:19,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:24,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:28,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:31,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:57:31,331 INFO L93 Difference]: Finished difference Result 136 states and 202 transitions. [2023-11-29 01:57:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:57:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-11-29 01:57:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:57:31,336 INFO L225 Difference]: With dead ends: 136 [2023-11-29 01:57:31,336 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 01:57:31,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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 01:57:31,338 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:57:31,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 121 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 28.4s Time] [2023-11-29 01:57:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 01:57:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2023-11-29 01:57:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 01:57:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2023-11-29 01:57:31,374 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 100 [2023-11-29 01:57:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:57:31,375 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2023-11-29 01:57:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:57:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2023-11-29 01:57:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:57:31,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:57:31,378 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:57:31,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:31,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:31,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:57:31,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:57:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -662166147, now seen corresponding path program 1 times [2023-11-29 01:57:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:57:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695164662] [2023-11-29 01:57:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:57:31,581 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 01:57:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:57:31,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:31,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:57:32,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:57:32,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:57:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 255 proven. 21 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-11-29 01:57:32,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:57:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-29 01:57:33,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:57:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695164662] [2023-11-29 01:57:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695164662] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:57:33,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:57:33,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-11-29 01:57:33,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402185538] [2023-11-29 01:57:33,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:57:33,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:57:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:57:33,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:57:33,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:57:33,161 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 01:57:38,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:42,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:46,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:57:46,102 INFO L93 Difference]: Finished difference Result 187 states and 271 transitions. [2023-11-29 01:57:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:57:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 100 [2023-11-29 01:57:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:57:46,184 INFO L225 Difference]: With dead ends: 187 [2023-11-29 01:57:46,185 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:57:46,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:57:46,187 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 85 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:57:46,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 91 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2023-11-29 01:57:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:57:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-11-29 01:57:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 01:57:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2023-11-29 01:57:46,214 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 100 [2023-11-29 01:57:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:57:46,215 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2023-11-29 01:57:46,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 01:57:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2023-11-29 01:57:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:57:46,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:57:46,218 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:57:46,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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)] Ended with exit code 0 [2023-11-29 01:57:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:46,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:57:46,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:57:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash -662106565, now seen corresponding path program 1 times [2023-11-29 01:57:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:57:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632763318] [2023-11-29 01:57:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:57:46,426 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 01:57:46,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:57:46,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:46,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_335095eb-78f5-4f34-b5c1-ed9b4018d3e5/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 01:57:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:57:46,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:57:46,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:57:55,997 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:58:04,326 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:58:12,482 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:58:20,784 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:58:24,861 WARN L854 $PredicateComparison]: unable to prove that (and (not (fp.geq c_~var_1_3~0 c_~var_1_2~0)) (= (_ bv1 8) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32))) is different from false [2023-11-29 01:58:28,935 WARN L876 $PredicateComparison]: unable to prove that (and (not (fp.geq c_~var_1_3~0 c_~var_1_2~0)) (= (_ bv1 8) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32))) is different from true [2023-11-29 01:58:37,264 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:58:45,551 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:58:53,717 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:59:02,022 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:59:10,329 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:59:14,411 WARN L854 $PredicateComparison]: unable to prove that (and (not (fp.geq c_~var_1_3~0 c_~var_1_2~0)) (= (_ bv1 8) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (= c_~var_1_16~0 c_~var_1_14~0)) is different from false [2023-11-29 01:59:18,489 WARN L876 $PredicateComparison]: unable to prove that (and (not (fp.geq c_~var_1_3~0 c_~var_1_2~0)) (= (_ bv1 8) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (= c_~var_1_16~0 c_~var_1_14~0)) is different from true [2023-11-29 02:04:23,912 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:04:29,929 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:04:42,622 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:04:51,295 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:04:59,641 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:05:07,983 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:05:16,313 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:05:25,015 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:05:41,807 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:05:50,152 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:05:58,498 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:06:06,855 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:06:15,195 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:06:23,528 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:06:31,888 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:06:40,236 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:06:48,606 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:01,324 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:10,014 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:18,384 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:26,712 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:35,062 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:43,724 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:07:52,108 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:00,481 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:08,842 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:21,596 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:30,337 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:38,723 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:47,103 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:08:55,471 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:04,228 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:12,589 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:20,937 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:29,287 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:37,636 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:45,985 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:09:54,357 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:02,716 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:11,094 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:19,899 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:28,250 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:36,592 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:45,017 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:10:53,378 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:11:01,714 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:11:10,084 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:11:18,468 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:11:26,830 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:11:35,183 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:11:43,549 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)