./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.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_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme --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 d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:46:59,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:46:59,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:46:59,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:46:59,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:46:59,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:46:59,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:46:59,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:46:59,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:46:59,912 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:46:59,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:46:59,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:46:59,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:46:59,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:46:59,917 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:46:59,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:46:59,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:46:59,919 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:46:59,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:46:59,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:46:59,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:46:59,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:46:59,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:46:59,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:46:59,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:46:59,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:46:59,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:46:59,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:46:59,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:46:59,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:46:59,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:46:59,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:46:59,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:46:59,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:46:59,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:46:59,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:46:59,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:46:59,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:46:59,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:46:59,929 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:46:59,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:46:59,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:46:59,930 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_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme 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 -> d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 [2023-11-26 11:47:00,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:00,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:00,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:00,288 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:00,289 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:00,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2023-11-26 11:47:03,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:03,570 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:03,571 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2023-11-26 11:47:03,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data/9f29032b2/bfc2462a03894630b87a52b50689c9e7/FLAG6db8592d2 [2023-11-26 11:47:03,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data/9f29032b2/bfc2462a03894630b87a52b50689c9e7 [2023-11-26 11:47:03,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:03,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:03,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:03,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:03,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:03,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:03" (1/1) ... [2023-11-26 11:47:03,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c75cb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:03, skipping insertion in model container [2023-11-26 11:47:03,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:03" (1/1) ... [2023-11-26 11:47:03,902 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:04,081 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_57617288-faad-4422-9673-677748e845f0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2023-11-26 11:47:04,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:04,160 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:04,173 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_57617288-faad-4422-9673-677748e845f0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2023-11-26 11:47:04,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:04,232 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:04,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04 WrapperNode [2023-11-26 11:47:04,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:04,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:04,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:04,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:04,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,286 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2023-11-26 11:47:04,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:04,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:04,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:04,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:04,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,320 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-26 11:47:04,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:04,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:04,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:04,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:04,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (1/1) ... [2023-11-26 11:47:04,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:04,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:04,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:47:04,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:47:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:47:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:04,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:04,577 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:04,579 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:04,900 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:04,961 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:04,962 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:47:04,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:04 BoogieIcfgContainer [2023-11-26 11:47:04,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:04,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:04,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:04,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:04,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:03" (1/3) ... [2023-11-26 11:47:04,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e0e006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:04, skipping insertion in model container [2023-11-26 11:47:04,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:04" (2/3) ... [2023-11-26 11:47:04,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e0e006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:04, skipping insertion in model container [2023-11-26 11:47:04,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:04" (3/3) ... [2023-11-26 11:47:04,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2023-11-26 11:47:04,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:04,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:05,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:05,078 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;@2b20e30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:05,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:47:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-26 11:47:05,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:05,119 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:05,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:05,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1931576549, now seen corresponding path program 1 times [2023-11-26 11:47:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530150274] [2023-11-26 11:47:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 11:47:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-26 11:47:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 11:47:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 11:47:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 11:47:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:47:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:47:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:47:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:47:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:47:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530150274] [2023-11-26 11:47:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530150274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:05,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624626351] [2023-11-26 11:47:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:05,646 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:47:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:05,742 INFO L93 Difference]: Finished difference Result 125 states and 220 transitions. [2023-11-26 11:47:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-26 11:47:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:05,758 INFO L225 Difference]: With dead ends: 125 [2023-11-26 11:47:05,758 INFO L226 Difference]: Without dead ends: 62 [2023-11-26 11:47:05,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-26 11:47:05,777 INFO L413 NwaCegarLoop]: 94 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, 94 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-26 11:47:05,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-26 11:47:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-26 11:47:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 42 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:47:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2023-11-26 11:47:05,835 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 118 [2023-11-26 11:47:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:05,835 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2023-11-26 11:47:05,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:47:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2023-11-26 11:47:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-26 11:47:05,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:05,840 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:47:05,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:05,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1134534385, now seen corresponding path program 1 times [2023-11-26 11:47:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080857377] [2023-11-26 11:47:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 11:47:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-26 11:47:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 11:47:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 11:47:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 11:47:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:47:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:47:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:47:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:47:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-26 11:47:06,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080857377] [2023-11-26 11:47:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080857377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202068882] [2023-11-26 11:47:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:06,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:47:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:06,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:47:06,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:47:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:07,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:47:07,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-11-26 11:47:07,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-26 11:47:07,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202068882] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:47:07,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:47:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-26 11:47:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399594883] [2023-11-26 11:47:07,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:47:07,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:47:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:47:07,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:47:07,626 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-26 11:47:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:08,243 INFO L93 Difference]: Finished difference Result 176 states and 268 transitions. [2023-11-26 11:47:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:47:08,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 118 [2023-11-26 11:47:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:08,248 INFO L225 Difference]: With dead ends: 176 [2023-11-26 11:47:08,249 INFO L226 Difference]: Without dead ends: 115 [2023-11-26 11:47:08,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2023-11-26 11:47:08,252 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 320 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:08,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 222 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 11:47:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-26 11:47:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2023-11-26 11:47:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 11:47:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2023-11-26 11:47:08,290 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 118 [2023-11-26 11:47:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:08,293 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2023-11-26 11:47:08,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-26 11:47:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2023-11-26 11:47:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-26 11:47:08,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:08,305 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:08,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:47:08,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-26 11:47:08,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:08,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 100007560, now seen corresponding path program 1 times [2023-11-26 11:47:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415272249] [2023-11-26 11:47:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 11:47:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-26 11:47:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 11:47:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 11:47:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 11:47:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:47:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:47:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:47:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:47:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:47:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415272249] [2023-11-26 11:47:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415272249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:08,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:47:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416498322] [2023-11-26 11:47:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:47:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:47:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:47:08,911 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:47:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:09,227 INFO L93 Difference]: Finished difference Result 222 states and 332 transitions. [2023-11-26 11:47:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:47:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2023-11-26 11:47:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:09,232 INFO L225 Difference]: With dead ends: 222 [2023-11-26 11:47:09,232 INFO L226 Difference]: Without dead ends: 124 [2023-11-26 11:47:09,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:47:09,234 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 167 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:09,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 341 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:47:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-26 11:47:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2023-11-26 11:47:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 11:47:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2023-11-26 11:47:09,257 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 120 [2023-11-26 11:47:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:09,258 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2023-11-26 11:47:09,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:47:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2023-11-26 11:47:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-26 11:47:09,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:09,261 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:09,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:47:09,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:09,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash -921060794, now seen corresponding path program 1 times [2023-11-26 11:47:09,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704032622] [2023-11-26 11:47:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:47:09,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:47:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:47:09,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:47:09,503 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:47:09,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:47:09,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:47:09,510 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:47:09,514 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:47:09,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:47:09,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-26 11:47:09,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:47:09 BoogieIcfgContainer [2023-11-26 11:47:09,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:47:09,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:47:09,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:47:09,617 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:47:09,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:04" (3/4) ... [2023-11-26 11:47:09,620 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:47:09,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:47:09,622 INFO L158 Benchmark]: Toolchain (without parser) took 5772.83ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 74.3MB in the end (delta: 53.6MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2023-11-26 11:47:09,622 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 94.7MB in the end (delta: 23.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:47:09,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.71ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 114.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 11:47:09,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.84ms. Allocated memory is still 161.5MB. Free memory was 114.6MB in the beginning and 111.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:47:09,623 INFO L158 Benchmark]: Boogie Preprocessor took 70.88ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 109.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:47:09,624 INFO L158 Benchmark]: RCFGBuilder took 604.38ms. Allocated memory is still 161.5MB. Free memory was 109.1MB in the beginning and 90.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:47:09,624 INFO L158 Benchmark]: TraceAbstraction took 4648.85ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 74.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-11-26 11:47:09,624 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 161.5MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:47:09,627 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.29ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 94.7MB in the end (delta: 23.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.71ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 114.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.84ms. Allocated memory is still 161.5MB. Free memory was 114.6MB in the beginning and 111.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.88ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 109.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 604.38ms. Allocated memory is still 161.5MB. Free memory was 109.1MB in the beginning and 90.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4648.85ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 74.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 161.5MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_2 = -256; [L24] signed long int var_1_3 = 256; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 127.5; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 10000000000000.125; [L29] double var_1_8 = 1.25; [L30] double var_1_9 = 4.125; [L31] double var_1_10 = 25.7; [L32] signed long int var_1_11 = -2; [L33] double var_1_12 = 49.75; [L34] signed long int var_1_13 = 5; [L35] signed long int var_1_14 = 128; [L36] signed long int var_1_15 = 1000; [L37] double var_1_16 = 0.2; [L38] double var_1_17 = 0.25; [L39] double var_1_18 = 99999999999999.5; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L97] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L99] var_1_3 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L100] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L102] var_1_4 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L103] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L105] var_1_6 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L106] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L108] var_1_7 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4, var_1_9=33/8] [L109] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4, var_1_9=33/8] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L111] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L112] var_1_10 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L113] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L114] var_1_12 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L115] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L116] var_1_13 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L117] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L118] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L118] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L119] var_1_14 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L120] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L121] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L121] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L122] var_1_17 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L123] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L124] var_1_18 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L125] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L138] RET updateVariables() [L139] CALL step() [L43] signed long int stepLocal_0 = var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16))); VAL [isInitial=1, stepLocal_0=4, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L44] COND FALSE !(stepLocal_0 >= var_1_3) VAL [isInitial=1, stepLocal_0=4, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L47] signed long int stepLocal_2 = var_1_3; [L48] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L49] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=1, var_1_8=5/4] [L50] COND FALSE !(var_1_2 >= stepLocal_2) [L55] var_1_5 = var_1_7 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=5/4] [L58] COND FALSE !(10.55f < var_1_5) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=5/4] [L63] COND TRUE var_1_5 > var_1_7 [L64] var_1_8 = var_1_10 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L69] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L70] COND FALSE !(((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L76] EXPR var_1_3 & var_1_13 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L76] COND FALSE !((- var_1_2) > (var_1_3 & var_1_13)) [L87] var_1_15 = var_1_13 VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L89] COND TRUE ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7 [L90] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, stepLocal_0=4, stepLocal_1=1, stepLocal_2=66, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR ((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L130-L131] return (((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=1, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 261 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=3, InterpolantAutomatonStates: 26, 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, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 1787 SizeOfPredicates, 4 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2943/3060 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-26 11:47:09,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme --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 d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:12,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:12,597 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:47:12,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:12,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:12,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:12,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:12,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:12,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:12,665 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:12,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:12,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:12,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:12,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:12,670 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:12,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:12,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:47:12,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:12,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:12,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:12,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:47:12,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:12,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:47:12,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:47:12,676 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:47:12,677 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:47:12,677 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:12,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:47:12,678 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:12,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:12,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:12,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:12,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:12,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:12,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:12,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:12,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:47:12,683 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:47:12,683 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:47:12,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:12,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:12,684 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:47:12,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:12,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:12,686 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:47:12,686 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_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme 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 -> d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 [2023-11-26 11:47:13,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:13,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:13,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:13,164 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:13,166 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:13,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2023-11-26 11:47:16,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:16,699 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:16,700 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2023-11-26 11:47:16,723 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data/5c81e74d0/7c089c84fffe4a00ad67dfa85580d2fa/FLAG7d0503b79 [2023-11-26 11:47:16,738 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/data/5c81e74d0/7c089c84fffe4a00ad67dfa85580d2fa [2023-11-26 11:47:16,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:16,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:16,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:16,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:16,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:16,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:16" (1/1) ... [2023-11-26 11:47:16,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef8cfe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:16, skipping insertion in model container [2023-11-26 11:47:16,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:16" (1/1) ... [2023-11-26 11:47:16,784 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:16,957 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_57617288-faad-4422-9673-677748e845f0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2023-11-26 11:47:17,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:17,073 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:17,090 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_57617288-faad-4422-9673-677748e845f0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2023-11-26 11:47:17,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:17,165 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:17,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17 WrapperNode [2023-11-26 11:47:17,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:17,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:17,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:17,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:17,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,250 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2023-11-26 11:47:17,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:17,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:17,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:17,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:17,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,354 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-26 11:47:17,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:17,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:17,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:17,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:17,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (1/1) ... [2023-11-26 11:47:17,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:17,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:17,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:17,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:47:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:47:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:47:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:17,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:17,657 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:17,659 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:30,158 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:30,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:30,213 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:47:30,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:30 BoogieIcfgContainer [2023-11-26 11:47:30,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:30,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:30,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:30,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:30,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:16" (1/3) ... [2023-11-26 11:47:30,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1794ad92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:30, skipping insertion in model container [2023-11-26 11:47:30,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:17" (2/3) ... [2023-11-26 11:47:30,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1794ad92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:30, skipping insertion in model container [2023-11-26 11:47:30,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:30" (3/3) ... [2023-11-26 11:47:30,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2023-11-26 11:47:30,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:30,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:30,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:30,305 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;@77cd71ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:30,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:47:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-26 11:47:30,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:30,345 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:30,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:30,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1562013753, now seen corresponding path program 1 times [2023-11-26 11:47:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272172927] [2023-11-26 11:47:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:30,370 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-26 11:47:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:30,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:30,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:47:31,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2023-11-26 11:47:31,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:31,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272172927] [2023-11-26 11:47:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272172927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:31,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:31,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660310502] [2023-11-26 11:47:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:31,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:31,118 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:47:35,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:47:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:35,330 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2023-11-26 11:47:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2023-11-26 11:47:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:35,386 INFO L225 Difference]: With dead ends: 111 [2023-11-26 11:47:35,386 INFO L226 Difference]: Without dead ends: 55 [2023-11-26 11:47:35,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-26 11:47:35,395 INFO L413 NwaCegarLoop]: 82 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, 82 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-26 11:47:35,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-11-26 11:47:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-26 11:47:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-26 11:47:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:47:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2023-11-26 11:47:35,474 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 115 [2023-11-26 11:47:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:35,474 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2023-11-26 11:47:35,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:47:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2023-11-26 11:47:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-26 11:47:35,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:35,484 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:35,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:35,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:35,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:35,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 349138629, now seen corresponding path program 1 times [2023-11-26 11:47:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106244930] [2023-11-26 11:47:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,706 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-26 11:47:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:35,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:35,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:47:36,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-11-26 11:47:37,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-26 11:47:38,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106244930] [2023-11-26 11:47:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106244930] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:47:38,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:47:38,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-26 11:47:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206414034] [2023-11-26 11:47:38,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:47:38,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:47:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:47:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:47:38,654 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-11-26 11:47:44,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:47:48,382 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-26 11:47:52,386 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-26 11:47:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:52,795 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2023-11-26 11:47:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:47:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 115 [2023-11-26 11:47:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:52,799 INFO L225 Difference]: With dead ends: 128 [2023-11-26 11:47:52,799 INFO L226 Difference]: Without dead ends: 74 [2023-11-26 11:47:52,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2023-11-26 11:47:52,802 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 87 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 54 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:52,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 218 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 220 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2023-11-26 11:47:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-26 11:47:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2023-11-26 11:47:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.255813953488372) internal successors, (54), 44 states have internal predecessors, (54), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 11:47:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2023-11-26 11:47:52,831 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 115 [2023-11-26 11:47:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:52,836 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2023-11-26 11:47:52,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-11-26 11:47:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2023-11-26 11:47:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-26 11:47:52,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:52,846 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:47:52,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:47:53,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:53,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:53,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1335346964, now seen corresponding path program 1 times [2023-11-26 11:47:53,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:53,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939248574] [2023-11-26 11:47:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:53,063 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-26 11:47:53,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:53,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:53,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57617288-faad-4422-9673-677748e845f0/bin/uautomizer-verify-VRDe98Ueme/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-26 11:47:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:47:53,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:47:53,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:53,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939248574] [2023-11-26 11:47:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939248574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:53,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:53,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:47:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649300295] [2023-11-26 11:47:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:53,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:53,730 INFO L87 Difference]: Start difference. First operand 69 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:47:57,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:47:59,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:48:03,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []