./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX --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 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:35:26,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:35:26,559 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:35:26,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:35:26,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:35:26,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:35:26,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:35:26,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:35:26,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:35:26,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:35:26,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:35:26,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:35:26,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:35:26,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:35:26,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:35:26,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:35:26,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:35:26,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:35:26,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:35:26,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:35:26,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:35:26,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:35:26,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:35:26,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:35:26,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:35:26,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:35:26,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:35:26,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:35:26,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:35:26,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:35:26,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:35:26,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:35:26,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:26,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:35:26,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:35:26,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:35:26,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:35:26,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:35:26,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:35:26,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:35:26,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:35:26,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:35:26,645 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_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/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_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX 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 -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-11-08 17:35:26,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:35:26,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:35:26,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:35:26,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:35:26,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:35:27,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i Unable to find full path for "g++" [2024-11-08 17:35:29,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:35:29,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:35:29,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-08 17:35:29,368 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data/e40280548/92a73cddac354674a53afb76b9c8243f/FLAG785674fc2 [2024-11-08 17:35:29,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data/e40280548/92a73cddac354674a53afb76b9c8243f [2024-11-08 17:35:29,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:35:29,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:35:29,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:29,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:35:29,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:35:29,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:29,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de4afe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29, skipping insertion in model container [2024-11-08 17:35:29,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:29,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:35:29,667 WARN L250 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_aa0b5110-098a-47ce-885e-a78ca50a4605/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-08 17:35:29,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:29,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:35:29,800 WARN L250 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_aa0b5110-098a-47ce-885e-a78ca50a4605/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-08 17:35:29,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:29,898 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:35:29,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29 WrapperNode [2024-11-08 17:35:29,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:29,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:29,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:35:29,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:35:29,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:29,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:29,986 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2024-11-08 17:35:29,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:29,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:35:29,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:35:29,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:35:30,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,033 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-11-08 17:35:30,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:35:30,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:35:30,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:35:30,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:35:30,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (1/1) ... [2024-11-08 17:35:30,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:30,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:35:30,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:35:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:35:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:35:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:35:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:35:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:35:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:35:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:35:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:35:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:35:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:35:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:35:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:35:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:35:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:35:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:35:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:35:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:35:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:35:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:35:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:35:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:35:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:35:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:35:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:35:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:35:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:35:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:35:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:35:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:35:30,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:35:30,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:35:31,201 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-11-08 17:35:31,202 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:35:31,223 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:35:31,229 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:35:31,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:31 BoogieIcfgContainer [2024-11-08 17:35:31,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:35:31,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:35:31,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:35:31,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:35:31,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:35:29" (1/3) ... [2024-11-08 17:35:31,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab7c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:31, skipping insertion in model container [2024-11-08 17:35:31,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:29" (2/3) ... [2024-11-08 17:35:31,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab7c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:31, skipping insertion in model container [2024-11-08 17:35:31,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:31" (3/3) ... [2024-11-08 17:35:31,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-11-08 17:35:31,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:35:31,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:35:31,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:35:31,350 INFO L333 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, 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;@f419c3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:35:31,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:35:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 17:35:31,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:31,405 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:31,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:31,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1995847135, now seen corresponding path program 1 times [2024-11-08 17:35:31,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193849190] [2024-11-08 17:35:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:35:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:35:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:35:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:35:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:35:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:35:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:35:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:35:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:35:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:35:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:35:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:35:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193849190] [2024-11-08 17:35:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193849190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:31,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:35:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448534306] [2024-11-08 17:35:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:35:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:35:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:35:32,034 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:32,086 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-11-08 17:35:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:35:32,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-08 17:35:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:32,096 INFO L225 Difference]: With dead ends: 243 [2024-11-08 17:35:32,096 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 17:35:32,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:35:32,103 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:32,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 17:35:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 17:35:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-08 17:35:32,169 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 138 [2024-11-08 17:35:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:32,170 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-08 17:35:32,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-08 17:35:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 17:35:32,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:32,180 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:32,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:35:32,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:32,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1712812157, now seen corresponding path program 1 times [2024-11-08 17:35:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331044353] [2024-11-08 17:35:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:35:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:35:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:35:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:35:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:35:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:35:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:35:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:35:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:35:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:35:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:35:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:35:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331044353] [2024-11-08 17:35:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331044353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:32,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751757800] [2024-11-08 17:35:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:32,744 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:32,804 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-08 17:35:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:32,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-08 17:35:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:32,808 INFO L225 Difference]: With dead ends: 241 [2024-11-08 17:35:32,810 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:35:32,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:32,815 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:32,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:35:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-08 17:35:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-08 17:35:32,842 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 138 [2024-11-08 17:35:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:32,846 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-08 17:35:32,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-08 17:35:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 17:35:32,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:32,854 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:32,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:35:32,854 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1635117253, now seen corresponding path program 1 times [2024-11-08 17:35:32,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:32,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16833853] [2024-11-08 17:35:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:35:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:35:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:35:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:35:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:35:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:35:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:35:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:35:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:35:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:35:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:35:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:35:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16833853] [2024-11-08 17:35:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16833853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183182547] [2024-11-08 17:35:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:33,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:33,430 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 17:35:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:33,492 INFO L93 Difference]: Finished difference Result 245 states and 358 transitions. [2024-11-08 17:35:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-08 17:35:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:33,497 INFO L225 Difference]: With dead ends: 245 [2024-11-08 17:35:33,497 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 17:35:33,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:33,499 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:33,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 17:35:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-08 17:35:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2024-11-08 17:35:33,511 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 138 [2024-11-08 17:35:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:33,512 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2024-11-08 17:35:33,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 17:35:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2024-11-08 17:35:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:35:33,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:33,515 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:33,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:35:33,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:33,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2050169769, now seen corresponding path program 1 times [2024-11-08 17:35:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910247404] [2024-11-08 17:35:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:35:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:35:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:35:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:35:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:35:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:35:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:35:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:35:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:35:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:35:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:35:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:35:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910247404] [2024-11-08 17:35:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910247404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:34,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:34,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:35:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250667453] [2024-11-08 17:35:34,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:34,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:35:34,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:34,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:35:34,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:35:34,624 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 17:35:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:34,903 INFO L93 Difference]: Finished difference Result 337 states and 488 transitions. [2024-11-08 17:35:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:35:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-08 17:35:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:34,907 INFO L225 Difference]: With dead ends: 337 [2024-11-08 17:35:34,907 INFO L226 Difference]: Without dead ends: 215 [2024-11-08 17:35:34,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:35:34,913 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 111 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:34,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1148 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:35:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-08 17:35:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-08 17:35:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 190 states have internal predecessors, (267), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:35:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2024-11-08 17:35:34,948 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 140 [2024-11-08 17:35:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:34,948 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2024-11-08 17:35:34,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 17:35:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2024-11-08 17:35:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:35:34,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:34,953 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:34,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:35:34,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1415653184, now seen corresponding path program 1 times [2024-11-08 17:35:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405643658] [2024-11-08 17:35:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:35:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593363316] [2024-11-08 17:35:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:35,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:35:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:35,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:35:35,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:35:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:35:35,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:35:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:35:36,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:35:36,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:35:36,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:35:36,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:35:36,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:35:36,395 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 17:35:36,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:35:36,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:35:36 BoogieIcfgContainer [2024-11-08 17:35:36,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:35:36,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:35:36,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:35:36,541 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:35:36,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:31" (3/4) ... [2024-11-08 17:35:36,545 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:35:36,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:35:36,547 INFO L158 Benchmark]: Toolchain (without parser) took 7153.68ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 131.6MB in the beginning and 75.2MB in the end (delta: 56.4MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2024-11-08 17:35:36,548 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 84.9MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:35:36,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.35ms. Allocated memory is still 163.6MB. Free memory was 131.0MB in the beginning and 113.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 17:35:36,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.12ms. Allocated memory is still 163.6MB. Free memory was 113.4MB in the beginning and 109.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:35:36,549 INFO L158 Benchmark]: Boogie Preprocessor took 110.46ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 104.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:35:36,550 INFO L158 Benchmark]: RCFGBuilder took 1132.01ms. Allocated memory is still 163.6MB. Free memory was 104.3MB in the beginning and 64.2MB in the end (delta: 40.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 17:35:36,550 INFO L158 Benchmark]: TraceAbstraction took 5307.02ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 63.9MB in the beginning and 75.2MB in the end (delta: -11.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-08 17:35:36,550 INFO L158 Benchmark]: Witness Printer took 6.20ms. Allocated memory is still 197.1MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:35:36,553 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.25ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 84.9MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.35ms. Allocated memory is still 163.6MB. Free memory was 131.0MB in the beginning and 113.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.12ms. Allocated memory is still 163.6MB. Free memory was 113.4MB in the beginning and 109.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.46ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 104.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1132.01ms. Allocated memory is still 163.6MB. Free memory was 104.3MB in the beginning and 64.2MB in the end (delta: 40.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5307.02ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 63.9MB in the beginning and 75.2MB in the end (delta: -11.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Witness Printer took 6.20ms. Allocated memory is still 197.1MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; VAL [float_Array_0={4:0}, isInitial=0, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L64] float_Array_0[0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[1] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L68] float_Array_0[2] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L70] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L71] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L73] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L76] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L79] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L80] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[0][2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L103] RET updateVariables() [L104] CALL step() [L34] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L34] COND FALSE !(float_Array_0[2] >= 50.4f) [L37] EXPR unsigned_long_int_Array_0[0][2] [L37] EXPR unsigned_long_int_Array_0[1][2] [L37] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L37] COND FALSE !(unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) [L44] EXPR signed_short_int_Array_0[1] [L44] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L46] EXPR unsigned_long_int_Array_0[1][1] [L46] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L46] COND FALSE !(! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] unsigned_long_int_Array_0[0][0] = ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))) [L51] EXPR unsigned_long_int_Array_0[1][0] [L51] EXPR unsigned_long_int_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) [L60] EXPR signed_short_int_Array_0[3] [L60] signed_short_int_Array_0[0] = signed_short_int_Array_0[3] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 [L95] EXPR unsigned_long_int_Array_0[1][2] [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95-L96] return ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 2353 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1624 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 136 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 729 mSDtfsCounter, 136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:35:36,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX --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 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:35:39,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:35:39,222 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:35:39,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:35:39,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:35:39,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:35:39,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:35:39,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:35:39,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:35:39,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:35:39,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:35:39,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:35:39,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:35:39,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:35:39,273 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:35:39,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:35:39,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:35:39,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:35:39,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:35:39,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:35:39,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:35:39,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:35:39,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:35:39,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:35:39,280 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:35:39,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:35:39,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:35:39,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:35:39,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:35:39,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:35:39,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:35:39,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:35:39,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:35:39,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:35:39,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:39,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:35:39,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:35:39,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:35:39,286 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:35:39,286 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:35:39,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:35:39,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:35:39,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:35:39,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:35:39,287 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_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/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_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX 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 -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-11-08 17:35:39,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:35:39,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:35:39,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:35:39,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:35:39,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:35:39,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i Unable to find full path for "g++" [2024-11-08 17:35:41,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:35:42,074 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:35:42,075 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-08 17:35:42,100 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data/f0d21f57c/1237b1933f6a4ee697d033fab152f31c/FLAG76d12e9e5 [2024-11-08 17:35:42,117 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/data/f0d21f57c/1237b1933f6a4ee697d033fab152f31c [2024-11-08 17:35:42,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:35:42,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:35:42,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:42,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:35:42,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:35:42,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dec0701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42, skipping insertion in model container [2024-11-08 17:35:42,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:35:42,393 WARN L250 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_aa0b5110-098a-47ce-885e-a78ca50a4605/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-08 17:35:42,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:42,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:35:42,590 WARN L250 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_aa0b5110-098a-47ce-885e-a78ca50a4605/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-08 17:35:42,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:42,740 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:35:42,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42 WrapperNode [2024-11-08 17:35:42,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:42,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:42,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:35:42,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:35:42,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,866 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-11-08 17:35:42,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:42,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:35:42,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:35:42,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:35:42,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,934 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-11-08 17:35:42,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:42,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:43,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:43,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:35:43,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:35:43,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:35:43,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:35:43,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (1/1) ... [2024-11-08 17:35:43,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:43,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:43,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:35:43,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:35:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:35:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 17:35:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 17:35:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 17:35:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 17:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:35:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:35:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:35:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:35:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:35:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:35:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:35:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:35:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:35:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:35:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:35:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:35:43,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:35:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:35:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:35:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:35:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 17:35:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 17:35:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:35:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:35:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:35:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:35:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:35:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:35:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:35:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:35:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:35:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:35:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:35:43,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:35:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:35:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:35:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 17:35:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 17:35:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:35:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:35:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:35:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:35:43,340 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:35:43,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:35:44,783 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-11-08 17:35:44,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:35:44,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:35:44,798 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:35:44,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:44 BoogieIcfgContainer [2024-11-08 17:35:44,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:35:44,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:35:44,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:35:44,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:35:44,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:35:42" (1/3) ... [2024-11-08 17:35:44,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540269f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:44, skipping insertion in model container [2024-11-08 17:35:44,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:42" (2/3) ... [2024-11-08 17:35:44,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540269f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:44, skipping insertion in model container [2024-11-08 17:35:44,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:44" (3/3) ... [2024-11-08 17:35:44,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-11-08 17:35:44,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:35:44,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:35:44,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:35:44,940 INFO L333 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, 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;@2633ce5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:35:44,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:35:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 17:35:44,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:44,971 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:44,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:44,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1995847135, now seen corresponding path program 1 times [2024-11-08 17:35:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:44,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386400069] [2024-11-08 17:35:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:45,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:45,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:35:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:45,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:35:45,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 17:35:45,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:35:45,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:35:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386400069] [2024-11-08 17:35:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386400069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:35:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946560214] [2024-11-08 17:35:45,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:35:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:35:45,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:35:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:35:45,683 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:45,749 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-11-08 17:35:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:35:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-08 17:35:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:45,767 INFO L225 Difference]: With dead ends: 243 [2024-11-08 17:35:45,767 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 17:35:45,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:35:45,779 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:45,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 17:35:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 17:35:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-08 17:35:45,839 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 138 [2024-11-08 17:35:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:45,840 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-08 17:35:45,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-08 17:35:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 17:35:45,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:45,846 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:45,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:35:46,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:46,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:46,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1712812157, now seen corresponding path program 1 times [2024-11-08 17:35:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:46,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073638511] [2024-11-08 17:35:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:46,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:46,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:46,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:46,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:35:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:35:46,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:35:46,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:35:46,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:35:46,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073638511] [2024-11-08 17:35:46,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073638511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:46,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:46,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782383731] [2024-11-08 17:35:46,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:35:46,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:46,532 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:46,630 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-08 17:35:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-08 17:35:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:46,633 INFO L225 Difference]: With dead ends: 241 [2024-11-08 17:35:46,633 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:35:46,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:46,636 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:46,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:35:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:35:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-08 17:35:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-08 17:35:46,659 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 138 [2024-11-08 17:35:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:46,664 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-08 17:35:46,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-08 17:35:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 17:35:46,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:46,672 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:46,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:35:46,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:46,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:46,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1635117253, now seen corresponding path program 1 times [2024-11-08 17:35:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889718732] [2024-11-08 17:35:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:46,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:46,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:46,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:35:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:47,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:35:47,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:35:47,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:35:47,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:35:47,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889718732] [2024-11-08 17:35:47,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889718732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505764421] [2024-11-08 17:35:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:47,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:35:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:47,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:47,307 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 17:35:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:47,357 INFO L93 Difference]: Finished difference Result 245 states and 358 transitions. [2024-11-08 17:35:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-08 17:35:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:47,360 INFO L225 Difference]: With dead ends: 245 [2024-11-08 17:35:47,361 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 17:35:47,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:47,363 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:47,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 17:35:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-08 17:35:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:35:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2024-11-08 17:35:47,375 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 138 [2024-11-08 17:35:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:47,376 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2024-11-08 17:35:47,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 17:35:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2024-11-08 17:35:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:35:47,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:47,380 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:47,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 17:35:47,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:47,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:47,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:47,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2050169769, now seen corresponding path program 1 times [2024-11-08 17:35:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852597194] [2024-11-08 17:35:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:47,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:47,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:47,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 17:35:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 17:35:48,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:48,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:35:48,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 17:35:48,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 17:35:49,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:35:49,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-08 17:35:49,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:35:49,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 50 [2024-11-08 17:35:49,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:35:49,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 38 [2024-11-08 17:35:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-08 17:35:49,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:35:49,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:35:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852597194] [2024-11-08 17:35:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852597194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:35:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946977882] [2024-11-08 17:35:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:49,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:35:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:35:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:35:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:35:49,725 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-08 17:35:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:51,063 INFO L93 Difference]: Finished difference Result 337 states and 488 transitions. [2024-11-08 17:35:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:35:51,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2024-11-08 17:35:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:51,070 INFO L225 Difference]: With dead ends: 337 [2024-11-08 17:35:51,071 INFO L226 Difference]: Without dead ends: 215 [2024-11-08 17:35:51,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:35:51,075 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 242 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:51,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 880 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:35:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-08 17:35:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-08 17:35:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 190 states have internal predecessors, (267), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:35:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2024-11-08 17:35:51,121 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 140 [2024-11-08 17:35:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:51,122 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2024-11-08 17:35:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-08 17:35:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2024-11-08 17:35:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:35:51,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:51,126 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:51,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 17:35:51,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:51,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1415653184, now seen corresponding path program 1 times [2024-11-08 17:35:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690662022] [2024-11-08 17:35:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:51,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:51,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:51,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 17:35:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:35:51,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:53,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-08 17:35:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 17:35:53,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:35:53,292 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:35:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690662022] [2024-11-08 17:35:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690662022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:53,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:35:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51584080] [2024-11-08 17:35:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:35:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:35:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:35:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:35:53,295 INFO L87 Difference]: Start difference. First operand 212 states and 307 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:55,985 INFO L93 Difference]: Finished difference Result 616 states and 893 transitions. [2024-11-08 17:35:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:35:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-08 17:35:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:55,991 INFO L225 Difference]: With dead ends: 616 [2024-11-08 17:35:55,991 INFO L226 Difference]: Without dead ends: 407 [2024-11-08 17:35:55,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:35:55,993 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 336 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:55,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 639 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 17:35:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-08 17:35:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2024-11-08 17:35:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 358 states have (on average 1.4078212290502794) internal successors, (504), 362 states have internal predecessors, (504), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 17:35:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 584 transitions. [2024-11-08 17:35:56,039 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 584 transitions. Word has length 140 [2024-11-08 17:35:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 584 transitions. [2024-11-08 17:35:56,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 584 transitions. [2024-11-08 17:35:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:35:56,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:56,044 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:56,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 17:35:56,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:56,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:56,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1157311426, now seen corresponding path program 1 times [2024-11-08 17:35:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:56,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428351564] [2024-11-08 17:35:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:56,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:56,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:56,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:56,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 17:35:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:56,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:35:56,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 17:35:56,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:35:56,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:35:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428351564] [2024-11-08 17:35:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428351564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489459338] [2024-11-08 17:35:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:56,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:35:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:56,611 INFO L87 Difference]: Start difference. First operand 403 states and 584 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:56,706 INFO L93 Difference]: Finished difference Result 803 states and 1165 transitions. [2024-11-08 17:35:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:56,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-08 17:35:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:56,711 INFO L225 Difference]: With dead ends: 803 [2024-11-08 17:35:56,712 INFO L226 Difference]: Without dead ends: 403 [2024-11-08 17:35:56,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:56,716 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:56,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-08 17:35:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-08 17:35:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 358 states have (on average 1.4022346368715084) internal successors, (502), 362 states have internal predecessors, (502), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 17:35:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 582 transitions. [2024-11-08 17:35:56,786 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 582 transitions. Word has length 140 [2024-11-08 17:35:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:56,786 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 582 transitions. [2024-11-08 17:35:56,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 17:35:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 582 transitions. [2024-11-08 17:35:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 17:35:56,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:56,789 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:56,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 17:35:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:56,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -717680419, now seen corresponding path program 1 times [2024-11-08 17:35:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:35:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516575370] [2024-11-08 17:35:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:56,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:35:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:35:56,996 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:35:56,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa0b5110-098a-47ce-885e-a78ca50a4605/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process