./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/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 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:47:45,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:47:45,457 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:47:45,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:47:45,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:47:45,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:47:45,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:47:45,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:47:45,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:47:45,520 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:47:45,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:47:45,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:47:45,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:47:45,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:47:45,524 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:47:45,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:47:45,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:47:45,526 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:47:45,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:47:45,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:47:45,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:47:45,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:47:45,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:47:45,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:47:45,530 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:47:45,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:47:45,547 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:47:45,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:47:45,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:47:45,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:47:45,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:47:45,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:47:45,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:47:45,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:47:45,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:47:45,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:47:45,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:47:45,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:47:45,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:47:45,552 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:47:45,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:47:45,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:47:45,553 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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/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 -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2023-11-26 10:47:45,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:47:45,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:47:45,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:47:45,925 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:47:45,926 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:47:45,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-26 10:47:49,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:47:49,441 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:47:49,443 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-26 10:47:49,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/data/74f8095e9/4659475993374ef599257db481255f1b/FLAGdb93b4bae [2023-11-26 10:47:49,475 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/data/74f8095e9/4659475993374ef599257db481255f1b [2023-11-26 10:47:49,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:47:49,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:47:49,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:47:49,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:47:49,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:47:49,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:49,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0fc65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49, skipping insertion in model container [2023-11-26 10:47:49,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:49,536 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:47:49,757 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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2023-11-26 10:47:49,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:47:49,822 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:47:49,840 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_6b7259d8-04ea-40af-8e87-eb0bf7bad215/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2023-11-26 10:47:49,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:47:49,891 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:47:49,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49 WrapperNode [2023-11-26 10:47:49,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:47:49,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:47:49,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:47:49,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:47:49,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:49,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,016 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2023-11-26 10:47:50,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:47:50,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:47:50,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:47:50,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:47:50,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,049 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 10:47:50,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:47:50,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:47:50,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:47:50,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:47:50,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (1/1) ... [2023-11-26 10:47:50,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:47:50,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:47:50,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:47:50,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:47:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:47:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:47:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:47:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:47:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:47:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:47:50,340 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:47:50,348 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:47:50,748 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:47:50,812 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:47:50,812 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:47:50,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:50 BoogieIcfgContainer [2023-11-26 10:47:50,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:47:50,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:47:50,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:47:50,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:47:50,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:47:49" (1/3) ... [2023-11-26 10:47:50,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a343c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:47:50, skipping insertion in model container [2023-11-26 10:47:50,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:49" (2/3) ... [2023-11-26 10:47:50,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a343c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:47:50, skipping insertion in model container [2023-11-26 10:47:50,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:50" (3/3) ... [2023-11-26 10:47:50,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-26 10:47:50,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:47:50,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:47:50,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:47:50,909 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;@58493797, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:47:50,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:47:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 10:47:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-26 10:47:50,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:50,939 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:50,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:50,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 626528525, now seen corresponding path program 1 times [2023-11-26 10:47:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:50,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003385600] [2023-11-26 10:47:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:47:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:47:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:47:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003385600] [2023-11-26 10:47:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003385600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:51,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:51,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:47:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000981883] [2023-11-26 10:47:51,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:51,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:47:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:47:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:47:51,528 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 10:47:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:51,573 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2023-11-26 10:47:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:47:51,576 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2023-11-26 10:47:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:51,589 INFO L225 Difference]: With dead ends: 99 [2023-11-26 10:47:51,589 INFO L226 Difference]: Without dead ends: 49 [2023-11-26 10:47:51,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:47:51,597 INFO L413 NwaCegarLoop]: 72 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, 72 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 10:47:51,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-26 10:47:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-26 10:47:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 10:47:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-26 10:47:51,673 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 112 [2023-11-26 10:47:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:51,673 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-26 10:47:51,674 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 10:47:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-26 10:47:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-26 10:47:51,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:51,678 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:51,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:47:51,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:51,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1281864269, now seen corresponding path program 1 times [2023-11-26 10:47:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:51,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632441534] [2023-11-26 10:47:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:47:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:47:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:47:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632441534] [2023-11-26 10:47:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632441534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:52,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:47:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978103564] [2023-11-26 10:47:52,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:52,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:47:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:47:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:47:52,886 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:53,274 INFO L93 Difference]: Finished difference Result 146 states and 224 transitions. [2023-11-26 10:47:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:47:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-26 10:47:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:53,282 INFO L225 Difference]: With dead ends: 146 [2023-11-26 10:47:53,282 INFO L226 Difference]: Without dead ends: 98 [2023-11-26 10:47:53,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:47:53,288 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:53,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 196 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:47:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-26 10:47:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-11-26 10:47:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 10:47:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2023-11-26 10:47:53,354 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 112 [2023-11-26 10:47:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:53,358 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2023-11-26 10:47:53,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2023-11-26 10:47:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 10:47:53,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:53,366 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:53,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:47:53,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:53,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash -810944936, now seen corresponding path program 1 times [2023-11-26 10:47:53,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:53,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120006885] [2023-11-26 10:47:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:53,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:47:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:47:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:47:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120006885] [2023-11-26 10:47:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120006885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:53,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:47:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306937401] [2023-11-26 10:47:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:53,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:47:53,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:47:53,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:53,651 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:53,738 INFO L93 Difference]: Finished difference Result 162 states and 249 transitions. [2023-11-26 10:47:53,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:47:53,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-26 10:47:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:53,741 INFO L225 Difference]: With dead ends: 162 [2023-11-26 10:47:53,741 INFO L226 Difference]: Without dead ends: 114 [2023-11-26 10:47:53,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:53,744 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:53,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 134 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-26 10:47:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-26 10:47:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 10:47:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2023-11-26 10:47:53,779 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 114 [2023-11-26 10:47:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:53,780 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2023-11-26 10:47:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2023-11-26 10:47:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 10:47:53,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:53,783 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:53,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:47:53,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:53,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -811004518, now seen corresponding path program 1 times [2023-11-26 10:47:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:53,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401548100] [2023-11-26 10:47:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:47:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:47:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:47:54,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401548100] [2023-11-26 10:47:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401548100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:47:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848830949] [2023-11-26 10:47:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:54,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:47:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:47:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:47:54,120 INFO L87 Difference]: Start difference. First operand 108 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:54,292 INFO L93 Difference]: Finished difference Result 172 states and 265 transitions. [2023-11-26 10:47:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:47:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-26 10:47:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:54,295 INFO L225 Difference]: With dead ends: 172 [2023-11-26 10:47:54,296 INFO L226 Difference]: Without dead ends: 107 [2023-11-26 10:47:54,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:47:54,298 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:54,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 200 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:47:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-26 10:47:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2023-11-26 10:47:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 10:47:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-11-26 10:47:54,355 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 114 [2023-11-26 10:47:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:54,356 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-11-26 10:47:54,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-11-26 10:47:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 10:47:54,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:54,359 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:54,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:47:54,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:54,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash -552779498, now seen corresponding path program 1 times [2023-11-26 10:47:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168773832] [2023-11-26 10:47:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:47:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:47:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:47:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:47:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:47:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:47:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:47:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:47:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:47:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:47:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:47:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:47:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:47:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:47:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:47:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:47:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:47:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:47:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:47:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168773832] [2023-11-26 10:47:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168773832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:55,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:55,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:47:55,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201747554] [2023-11-26 10:47:55,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:55,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:47:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:55,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:47:55,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:47:55,167 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:55,648 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2023-11-26 10:47:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:47:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-26 10:47:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:55,655 INFO L225 Difference]: With dead ends: 201 [2023-11-26 10:47:55,656 INFO L226 Difference]: Without dead ends: 138 [2023-11-26 10:47:55,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:47:55,660 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:55,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:47:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-26 10:47:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2023-11-26 10:47:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 10:47:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2023-11-26 10:47:55,717 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 114 [2023-11-26 10:47:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:55,717 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2023-11-26 10:47:55,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:47:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2023-11-26 10:47:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 10:47:55,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:55,720 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:55,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:47:55,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:55,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash -945806508, now seen corresponding path program 1 times [2023-11-26 10:47:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946238823] [2023-11-26 10:47:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:55,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:48:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:48:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:48:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:48:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:48:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:48:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:48:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:48:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:48:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:48:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:48:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:48:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:48:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:48:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:48:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:48:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:48:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:48:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:48:02,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946238823] [2023-11-26 10:48:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946238823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:02,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:02,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:48:02,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394875023] [2023-11-26 10:48:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:02,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:48:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:48:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:48:02,295 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:48:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:03,607 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2023-11-26 10:48:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:48:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-26 10:48:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:03,609 INFO L225 Difference]: With dead ends: 121 [2023-11-26 10:48:03,609 INFO L226 Difference]: Without dead ends: 119 [2023-11-26 10:48:03,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:48:03,611 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 58 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:03,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 268 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:48:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-26 10:48:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-11-26 10:48:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 10:48:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2023-11-26 10:48:03,648 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 114 [2023-11-26 10:48:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:03,648 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2023-11-26 10:48:03,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:48:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2023-11-26 10:48:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 10:48:03,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:03,651 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:03,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:48:03,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:03,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 829200854, now seen corresponding path program 1 times [2023-11-26 10:48:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:03,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542666178] [2023-11-26 10:48:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:48:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 10:48:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:48:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:48:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:48:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:48:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:48:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:48:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:48:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 10:48:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:48:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 10:48:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:48:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 10:48:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:48:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 10:48:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 10:48:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 10:48:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:48:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542666178] [2023-11-26 10:48:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542666178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:09,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:09,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:48:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341260399] [2023-11-26 10:48:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:09,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:48:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:48:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:48:09,189 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:48:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:10,212 INFO L93 Difference]: Finished difference Result 117 states and 173 transitions. [2023-11-26 10:48:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:48:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-26 10:48:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:10,213 INFO L225 Difference]: With dead ends: 117 [2023-11-26 10:48:10,213 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 10:48:10,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:48:10,215 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 28 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:10,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 256 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:48:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 10:48:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 10:48:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 10:48:10,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2023-11-26 10:48:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:10,217 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 10:48:10,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 10:48:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 10:48:10,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 10:48:10,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:48:10,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:48:10,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 10:48:11,212 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-11-26 10:48:11,213 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-26 10:48:11,213 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-26 10:48:11,213 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-26 10:48:11,213 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-11-26 10:48:11,213 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-11-26 10:48:11,213 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-26 10:48:11,215 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse0 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)))) (or (and .cse0 (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1)) (let ((.cse8 (* (div ~var_1_12~0 4294967296) 4294967296)) (.cse13 (+ ~var_1_8~0 1)) (.cse14 (= ~var_1_9~0 ~var_1_7~0)) (.cse4 (* (div ~var_1_10~0 4294967296) 4294967296)) (.cse11 (* 4294967295 ~var_1_13~0))) (let ((.cse1 (* 256 (div ~var_1_19~0 256))) (.cse7 (+ (* (div ~var_1_13~0 4294967296) 4294967296) ~var_1_12~0)) (.cse6 (or (and (<= .cse13 ~var_1_9~0) .cse14) (= (+ (* (div (+ .cse11 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0) (+ .cse4 .cse11 ~var_1_11~0)))) (.cse2 (not .cse14)) (.cse3 (< ~var_1_1~0 .cse13)) (.cse12 (< (+ .cse8 ~var_1_8~0) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_12~0)))) (and (= ~var_1_1~0 ~var_1_7~0) (= (+ (* (div ~var_1_18~0 256) 256) ~var_1_19~0) (+ ~var_1_18~0 .cse1)) (or (and (or .cse2 .cse3 (let ((.cse5 (* 4294967295 ~var_1_12~0))) (= (+ .cse4 ~var_1_11~0 .cse5 1) (+ ~var_1_10~0 (* 4294967296 (div (+ ~var_1_11~0 .cse5 1) 4294967296)))))) .cse6) (< .cse7 (+ .cse8 ~var_1_13~0 1))) (<= .cse1 ~var_1_18~0) (or .cse0 (and (or (< ~var_1_9~0 ~var_1_7~0) (let ((.cse9 (* (div ~var_1_9~0 256) 256))) (and (or (= (+ .cse9 256 ~var_1_8~0) ~var_1_9~0) (< ~var_1_9~0 (+ .cse9 128))) (or (< (+ .cse9 127) ~var_1_9~0) (= (+ .cse9 ~var_1_8~0) ~var_1_9~0))))) (or (let ((.cse10 (* (div ~var_1_7~0 256) 256))) (and (or (< (+ 127 .cse10) ~var_1_7~0) (= (+ ~var_1_8~0 .cse10) ~var_1_7~0)) (or (= (+ 256 ~var_1_8~0 .cse10) ~var_1_7~0) (< ~var_1_7~0 (+ 128 .cse10))))) (< ~var_1_7~0 (+ ~var_1_9~0 1))))) (or (< (+ .cse8 ~var_1_13~0) .cse7) (and .cse6 (or .cse2 .cse3 (= (+ .cse4 .cse11 ~var_1_11~0 1) (+ (* 4294967296 (div (+ .cse11 ~var_1_11~0 1) 4294967296)) ~var_1_10~0))))) (or (< ~var_1_8~0 0) (= ~var_1_8~0 ~var_1_14~0) .cse12) (or (= (+ ~var_1_8~0 ~var_1_14~0) 0) (< 0 .cse13) .cse12) (= 2 ~var_1_15~0) (= ~var_1_17~0 ~var_1_16~0)))))) [2023-11-26 10:48:11,215 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-11-26 10:48:11,215 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-11-26 10:48:11,216 INFO L899 garLoopResultBuilder]: For program point L44-4(lines 44 52) no Hoare annotation was computed. [2023-11-26 10:48:11,216 INFO L899 garLoopResultBuilder]: For program point L44-5(lines 43 68) no Hoare annotation was computed. [2023-11-26 10:48:11,216 INFO L902 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: true [2023-11-26 10:48:11,216 INFO L902 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: true [2023-11-26 10:48:11,216 INFO L899 garLoopResultBuilder]: For program point L53-1(lines 43 68) no Hoare annotation was computed. [2023-11-26 10:48:11,216 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-26 10:48:11,216 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-11-26 10:48:11,216 INFO L902 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: true [2023-11-26 10:48:11,216 INFO L902 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: true [2023-11-26 10:48:11,217 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-26 10:48:11,217 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 10:48:11,217 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-11-26 10:48:11,217 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-26 10:48:11,217 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-26 10:48:11,217 INFO L899 garLoopResultBuilder]: For program point L104-2(line 104) no Hoare annotation was computed. [2023-11-26 10:48:11,218 INFO L899 garLoopResultBuilder]: For program point L104-4(line 104) no Hoare annotation was computed. [2023-11-26 10:48:11,218 INFO L899 garLoopResultBuilder]: For program point L96(lines 69 97) no Hoare annotation was computed. [2023-11-26 10:48:11,218 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 67) no Hoare annotation was computed. [2023-11-26 10:48:11,218 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-11-26 10:48:11,218 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-11-26 10:48:11,218 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-26 10:48:11,218 INFO L902 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: true [2023-11-26 10:48:11,218 INFO L902 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: true [2023-11-26 10:48:11,218 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 58) no Hoare annotation was computed. [2023-11-26 10:48:11,223 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-26 10:48:11,223 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-26 10:48:11,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-26 10:48:11,224 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-26 10:48:11,224 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-26 10:48:11,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 10:48:11,225 INFO L902 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: true [2023-11-26 10:48:11,225 INFO L902 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: true [2023-11-26 10:48:11,225 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-26 10:48:11,225 INFO L902 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: true [2023-11-26 10:48:11,225 INFO L902 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: true [2023-11-26 10:48:11,225 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-26 10:48:11,226 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 68) no Hoare annotation was computed. [2023-11-26 10:48:11,226 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-26 10:48:11,226 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-26 10:48:11,226 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-26 10:48:11,226 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-26 10:48:11,232 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:11,234 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:48:11,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:48:11 BoogieIcfgContainer [2023-11-26 10:48:11,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:48:11,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:48:11,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:48:11,273 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:48:11,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:50" (3/4) ... [2023-11-26 10:48:11,277 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 10:48:11,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-26 10:48:11,289 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-26 10:48:11,290 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-26 10:48:11,290 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 10:48:11,291 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 10:48:11,429 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:48:11,430 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 10:48:11,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:48:11,431 INFO L158 Benchmark]: Toolchain (without parser) took 21950.35ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 138.9MB in the beginning and 99.9MB in the end (delta: 39.0MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. [2023-11-26 10:48:11,431 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:48:11,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.11ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 130.1MB in the end (delta: 8.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2023-11-26 10:48:11,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.92ms. Allocated memory is still 169.9MB. Free memory was 130.1MB in the beginning and 139.7MB in the end (delta: -9.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:48:11,435 INFO L158 Benchmark]: Boogie Preprocessor took 52.63ms. Allocated memory is still 169.9MB. Free memory was 139.7MB in the beginning and 137.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:48:11,435 INFO L158 Benchmark]: RCFGBuilder took 742.29ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 116.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 10:48:11,436 INFO L158 Benchmark]: TraceAbstraction took 20456.85ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 116.4MB in the beginning and 106.2MB in the end (delta: 10.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2023-11-26 10:48:11,436 INFO L158 Benchmark]: Witness Printer took 157.25ms. Allocated memory is still 247.5MB. Free memory was 106.2MB in the beginning and 99.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:48:11,439 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.28ms. Allocated memory is still 125.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.11ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 130.1MB in the end (delta: 8.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.92ms. Allocated memory is still 169.9MB. Free memory was 130.1MB in the beginning and 139.7MB in the end (delta: -9.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.63ms. Allocated memory is still 169.9MB. Free memory was 139.7MB in the beginning and 137.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 742.29ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 116.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20456.85ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 116.4MB in the beginning and 106.2MB in the end (delta: 10.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * Witness Printer took 157.25ms. Allocated memory is still 247.5MB. Free memory was 106.2MB in the beginning and 99.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 1422 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 497 mSDtfsCounter, 342 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 57 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 145 PreInvPairs, 183 NumberOfFragments, 560 HoareAnnotationTreeSize, 145 FomulaSimplifications, 479 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 275 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 5960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((var_1_5 == ((var_1_5 / 256) * 256)) && ((16 + var_1_15) == 0)) && (((last_1_var_1_15 / 4294967296) + 1) <= 0)) && (25 == var_1_10)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && (0 <= (last_1_var_1_18 / 256))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (last_1_var_1_18 < 1)) || ((((((((((var_1_1 == var_1_7) && ((((var_1_18 / 256) * 256) + var_1_19) == (var_1_18 + (256 * (var_1_19 / 256))))) && ((((!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1))) || ((((((var_1_10 / 4294967296) * 4294967296) + var_1_11) + (4294967295 * var_1_12)) + 1) == (var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))))) && ((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11)))) || ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) < ((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1)))) && ((256 * (var_1_19 / 256)) <= var_1_18)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && (((((var_1_12 / 4294967296) * 4294967296) + var_1_13) < (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) || (((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11))) && ((!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1))) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11) + 1) == ((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10)))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) RESULT: Ultimate proved your program to be correct! [2023-11-26 10:48:11,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7259d8-04ea-40af-8e87-eb0bf7bad215/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE