./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:56:02,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:56:02,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:56:02,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:56:02,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:56:02,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:56:02,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:56:02,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:56:02,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:56:02,645 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:56:02,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:56:02,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:56:02,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:56:02,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:56:02,648 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:56:02,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:56:02,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:56:02,649 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:56:02,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:56:02,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:56:02,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:56:02,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:56:02,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:56:02,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:56:02,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:56:02,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:56:02,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:56:02,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:56:02,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:56:02,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:56:02,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:56:02,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:02,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:56:02,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:56:02,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:56:02,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:56:02,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:56:02,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:56:02,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:56:02,661 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:56:02,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:56:02,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:56:02,665 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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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 -> 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 [2023-11-26 11:56:02,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:56:02,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:56:02,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:56:02,997 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:56:02,998 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:56:02,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-26 11:56:06,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:56:06,416 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:56:06,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-26 11:56:06,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data/752fd1123/ccbaadee68414fb9909ac5330f367d7d/FLAG0cdf40b61 [2023-11-26 11:56:06,439 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data/752fd1123/ccbaadee68414fb9909ac5330f367d7d [2023-11-26 11:56:06,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:56:06,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:56:06,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:06,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:56:06,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:56:06,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716a2485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06, skipping insertion in model container [2023-11-26 11:56:06,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,483 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:56:06,711 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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-26 11:56:06,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:06,767 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:56:06,781 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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-26 11:56:06,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:06,824 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:56:06,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06 WrapperNode [2023-11-26 11:56:06,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:06,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:06,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:56:06,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:56:06,835 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:56:06" (1/1) ... [2023-11-26 11:56:06,845 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:56:06" (1/1) ... [2023-11-26 11:56:06,888 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2023-11-26 11:56:06,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:06,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:56:06,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:56:06,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:56:06,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,923 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:56:06,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:56:06,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:56:06,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:56:06,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:56:06,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (1/1) ... [2023-11-26 11:56:06,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:06,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:07,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:56:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:56:07,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:56:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:56:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:56:07,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:56:07,116 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:56:07,118 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:56:07,397 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:56:07,477 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:56:07,482 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:56:07,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:07 BoogieIcfgContainer [2023-11-26 11:56:07,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:56:07,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:56:07,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:56:07,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:56:07,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:56:06" (1/3) ... [2023-11-26 11:56:07,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172b360a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:07, skipping insertion in model container [2023-11-26 11:56:07,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:06" (2/3) ... [2023-11-26 11:56:07,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172b360a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:07, skipping insertion in model container [2023-11-26 11:56:07,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:07" (3/3) ... [2023-11-26 11:56:07,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2023-11-26 11:56:07,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:56:07,544 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:56:07,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:56:07,611 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;@2ba9409, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:56:07,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:56:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:56:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-26 11:56:07,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:07,636 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:07,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash -266298122, now seen corresponding path program 1 times [2023-11-26 11:56:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099009024] [2023-11-26 11:56:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:56:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:56:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:56:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:56:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:56:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:56:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:56:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:56:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:56:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:56:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:56:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:56:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:56:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:56:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:56:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:56:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:56:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099009024] [2023-11-26 11:56:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099009024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009541424] [2023-11-26 11:56:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:56:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:08,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:56:08,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:56:08,157 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:56:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:08,200 INFO L93 Difference]: Finished difference Result 105 states and 181 transitions. [2023-11-26 11:56:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:56:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2023-11-26 11:56:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:56:08,216 INFO L225 Difference]: With dead ends: 105 [2023-11-26 11:56:08,216 INFO L226 Difference]: Without dead ends: 52 [2023-11-26 11:56:08,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:56:08,225 INFO L413 NwaCegarLoop]: 75 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, 75 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:56:08,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:56:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-26 11:56:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-26 11:56:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:56:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2023-11-26 11:56:08,307 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 105 [2023-11-26 11:56:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:56:08,308 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2023-11-26 11:56:08,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:56:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2023-11-26 11:56:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-26 11:56:08,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:08,320 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:56:08,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:08,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 412453368, now seen corresponding path program 1 times [2023-11-26 11:56:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:08,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928242754] [2023-11-26 11:56:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:56:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:56:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:56:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:56:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:56:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:56:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:56:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:56:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:56:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:56:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:56:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:56:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:56:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:56:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:56:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:56:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:56:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928242754] [2023-11-26 11:56:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928242754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:56:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958380736] [2023-11-26 11:56:09,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:09,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:56:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:56:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:56:09,416 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:56:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:09,959 INFO L93 Difference]: Finished difference Result 184 states and 277 transitions. [2023-11-26 11:56:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:56:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-26 11:56:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:56:09,964 INFO L225 Difference]: With dead ends: 184 [2023-11-26 11:56:09,964 INFO L226 Difference]: Without dead ends: 133 [2023-11-26 11:56:09,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:56:09,967 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 155 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:56:09,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 421 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:56:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-26 11:56:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2023-11-26 11:56:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:56:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2023-11-26 11:56:09,985 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 105 [2023-11-26 11:56:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:56:09,987 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2023-11-26 11:56:09,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:56:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2023-11-26 11:56:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-26 11:56:09,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:09,992 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:56:09,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:09,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash 283165112, now seen corresponding path program 1 times [2023-11-26 11:56:09,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:09,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404224605] [2023-11-26 11:56:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:56:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:56:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:56:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:56:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:56:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:56:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:56:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:56:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:56:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:56:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:56:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:56:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:56:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:56:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:56:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:56:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:56:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404224605] [2023-11-26 11:56:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404224605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:56:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887371200] [2023-11-26 11:56:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:10,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:56:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:56:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:56:10,345 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:56:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:10,418 INFO L93 Difference]: Finished difference Result 161 states and 240 transitions. [2023-11-26 11:56:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:56:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-26 11:56:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:56:10,421 INFO L225 Difference]: With dead ends: 161 [2023-11-26 11:56:10,421 INFO L226 Difference]: Without dead ends: 102 [2023-11-26 11:56:10,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:56:10,423 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 77 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:56:10,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 465 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:56:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-26 11:56:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2023-11-26 11:56:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:56:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2023-11-26 11:56:10,435 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 105 [2023-11-26 11:56:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:56:10,436 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2023-11-26 11:56:10,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:56:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2023-11-26 11:56:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-26 11:56:10,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:10,439 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:56:10,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:10,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 503678509, now seen corresponding path program 1 times [2023-11-26 11:56:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:10,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797403834] [2023-11-26 11:56:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:10,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:10,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:10,626 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:56:10,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:56:10,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:56:10,634 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:56:10,638 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:56:10,731 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-26 11:56:10,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-26 11:56:10,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-26 11:56:10,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-26 11:56:10,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-26 11:56:10,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:56:10 BoogieIcfgContainer [2023-11-26 11:56:10,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:56:10,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:56:10,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:56:10,758 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:56:10,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:07" (3/4) ... [2023-11-26 11:56:10,761 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:56:10,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:56:10,763 INFO L158 Benchmark]: Toolchain (without parser) took 4318.80ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 80.3MB in the beginning and 53.7MB in the end (delta: 26.6MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2023-11-26 11:56:10,763 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:56:10,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.88ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 67.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:56:10,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.15ms. Allocated memory is still 125.8MB. Free memory was 67.8MB in the beginning and 65.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:56:10,764 INFO L158 Benchmark]: Boogie Preprocessor took 64.35ms. Allocated memory is still 125.8MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:56:10,765 INFO L158 Benchmark]: RCFGBuilder took 528.13ms. Allocated memory is still 125.8MB. Free memory was 63.1MB in the beginning and 95.4MB in the end (delta: -32.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-11-26 11:56:10,765 INFO L158 Benchmark]: TraceAbstraction took 3271.29ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 94.7MB in the beginning and 53.7MB in the end (delta: 41.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2023-11-26 11:56:10,766 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 165.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:56:10,768 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.31ms. Allocated memory is still 125.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.88ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 67.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.15ms. Allocated memory is still 125.8MB. Free memory was 67.8MB in the beginning and 65.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.35ms. Allocated memory is still 125.8MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.13ms. Allocated memory is still 125.8MB. Free memory was 63.1MB in the beginning and 95.4MB in the end (delta: -32.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3271.29ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 94.7MB in the beginning and 53.7MB in the end (delta: 41.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 165.7MB. Free memory is still 53.7MB. 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~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 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 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L105] RET updateVariables() [L106] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967295, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967295, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 961 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 627 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 334 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 122 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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:56:10,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:56:13,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:56:13,749 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:56:13,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:56:13,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:56:13,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:56:13,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:56:13,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:56:13,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:56:13,816 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:56:13,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:56:13,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:56:13,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:56:13,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:56:13,820 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:56:13,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:56:13,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:56:13,822 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:56:13,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:56:13,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:56:13,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:56:13,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:56:13,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:56:13,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:56:13,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:56:13,826 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:56:13,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:56:13,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:56:13,828 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:56:13,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:56:13,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:56:13,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:56:13,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:56:13,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:13,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:56:13,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:56:13,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:56:13,832 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:56:13,832 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:56:13,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:56:13,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:56:13,833 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:56:13,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:56:13,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:56:13,834 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:56:13,834 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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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 -> 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 [2023-11-26 11:56:14,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:56:14,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:56:14,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:56:14,268 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:56:14,269 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:56:14,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-26 11:56:17,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:56:17,845 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:56:17,846 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-26 11:56:17,858 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data/709b32c6e/f6c53bcf0abb47f9ab6796ef28f9ba7a/FLAG531362ad8 [2023-11-26 11:56:17,879 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/data/709b32c6e/f6c53bcf0abb47f9ab6796ef28f9ba7a [2023-11-26 11:56:17,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:56:17,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:56:17,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:17,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:56:17,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:56:17,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:17" (1/1) ... [2023-11-26 11:56:17,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5417b1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:17, skipping insertion in model container [2023-11-26 11:56:17,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:17" (1/1) ... [2023-11-26 11:56:17,948 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:56:18,153 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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-26 11:56:18,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:18,250 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:56:18,269 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_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-26 11:56:18,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:18,335 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:56:18,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18 WrapperNode [2023-11-26 11:56:18,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:18,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:18,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:56:18,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:56:18,346 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:56:18" (1/1) ... [2023-11-26 11:56:18,373 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:56:18" (1/1) ... [2023-11-26 11:56:18,417 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-11-26 11:56:18,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:18,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:56:18,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:56:18,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:56:18,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,518 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:56:18,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:56:18,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:56:18,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:56:18,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:56:18,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (1/1) ... [2023-11-26 11:56:18,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:18,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:18,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:18,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:18,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:56:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:56:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:56:18,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:56:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:56:18,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:56:18,762 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:56:18,765 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:56:19,135 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:56:19,240 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:56:19,242 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:56:19,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:19 BoogieIcfgContainer [2023-11-26 11:56:19,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:56:19,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:56:19,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:56:19,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:56:19,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:56:17" (1/3) ... [2023-11-26 11:56:19,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7affe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:19, skipping insertion in model container [2023-11-26 11:56:19,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:18" (2/3) ... [2023-11-26 11:56:19,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7affe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:19, skipping insertion in model container [2023-11-26 11:56:19,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:19" (3/3) ... [2023-11-26 11:56:19,257 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2023-11-26 11:56:19,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:56:19,280 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:56:19,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:56:19,352 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;@5da38a2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:56:19,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:56:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:56:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 11:56:19,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:19,378 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:19,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1197207762, now seen corresponding path program 1 times [2023-11-26 11:56:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:56:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544585896] [2023-11-26 11:56:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:19,424 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:56:19,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:56:19,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:19,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:56:19,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-11-26 11:56:19,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:56:19,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:56:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544585896] [2023-11-26 11:56:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544585896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:19,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644296760] [2023-11-26 11:56:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:19,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:56:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:56:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:56:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:56:19,832 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:56:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:19,891 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2023-11-26 11:56:19,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:56:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2023-11-26 11:56:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:56:19,903 INFO L225 Difference]: With dead ends: 87 [2023-11-26 11:56:19,904 INFO L226 Difference]: Without dead ends: 43 [2023-11-26 11:56:19,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:56:19,913 INFO L413 NwaCegarLoop]: 61 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, 61 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:56:19,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:56:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-26 11:56:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-26 11:56:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:56:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-11-26 11:56:19,976 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 103 [2023-11-26 11:56:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:56:19,977 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-11-26 11:56:19,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:56:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-11-26 11:56:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 11:56:19,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:19,983 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:20,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:20,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:20,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1966328236, now seen corresponding path program 1 times [2023-11-26 11:56:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:56:20,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805267187] [2023-11-26 11:56:20,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:20,198 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:56:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:56:20,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:20,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:20,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-26 11:56:20,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 382 proven. 36 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-26 11:56:31,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-26 11:56:44,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:56:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805267187] [2023-11-26 11:56:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805267187] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:56:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [30] total 40 [2023-11-26 11:56:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643872290] [2023-11-26 11:56:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:44,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:56:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:56:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:56:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2023-11-26 11:56:44,939 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:56:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:49,623 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2023-11-26 11:56:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:56:49,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2023-11-26 11:56:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:56:49,627 INFO L225 Difference]: With dead ends: 79 [2023-11-26 11:56:49,627 INFO L226 Difference]: Without dead ends: 77 [2023-11-26 11:56:49,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=365, Invalid=1797, Unknown=0, NotChecked=0, Total=2162 [2023-11-26 11:56:49,630 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 115 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:56:49,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 202 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-26 11:56:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-26 11:56:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-11-26 11:56:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-26 11:56:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2023-11-26 11:56:49,659 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 103 [2023-11-26 11:56:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:56:49,660 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2023-11-26 11:56:49,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:56:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2023-11-26 11:56:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 11:56:49,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:49,663 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:49,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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)] Ended with exit code 0 [2023-11-26 11:56:49,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:49,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:49,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -191320874, now seen corresponding path program 1 times [2023-11-26 11:56:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:56:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794136132] [2023-11-26 11:56:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:49,870 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:56:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:56:49,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:49,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:49,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:56:49,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-26 11:56:50,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-26 11:56:50,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:56:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794136132] [2023-11-26 11:56:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794136132] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:50,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:56:50,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-26 11:56:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757537915] [2023-11-26 11:56:50,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:50,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:56:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:56:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:56:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:56:50,303 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-26 11:56:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:51,092 INFO L93 Difference]: Finished difference Result 162 states and 232 transitions. [2023-11-26 11:56:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:56:51,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 103 [2023-11-26 11:56:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:56:51,097 INFO L225 Difference]: With dead ends: 162 [2023-11-26 11:56:51,097 INFO L226 Difference]: Without dead ends: 98 [2023-11-26 11:56:51,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2023-11-26 11:56:51,101 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:56:51,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 193 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:56:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-26 11:56:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-11-26 11:56:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-26 11:56:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2023-11-26 11:56:51,141 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 103 [2023-11-26 11:56:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:56:51,142 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2023-11-26 11:56:51,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-26 11:56:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2023-11-26 11:56:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 11:56:51,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:56:51,146 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:51,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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)] Ended with exit code 0 [2023-11-26 11:56:51,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:51,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:56:51,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash -841647817, now seen corresponding path program 1 times [2023-11-26 11:56:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:56:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638091944] [2023-11-26 11:56:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:51,351 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:56:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:56:51,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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:56:51,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_577fc1cc-f9b5-4e2e-9661-6ec970d204e3/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 (5)] Waiting until timeout for monitored process [2023-11-26 11:56:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:51,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-26 11:56:51,550 INFO L285 TraceCheckSpWp]: Computing forward predicates...