./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.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_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:02:06,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:02:06,427 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:02:06,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:02:06,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:02:06,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:02:06,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:02:06,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:02:06,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:02:06,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:02:06,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:02:06,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:02:06,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:02:06,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:02:06,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:02:06,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:02:06,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:02:06,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:02:06,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:02:06,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:02:06,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:02:06,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:02:06,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:02:06,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:02:06,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:02:06,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:02:06,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:02:06,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:02:06,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:02:06,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:02:06,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:02:06,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:02:06,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:06,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:02:06,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:02:06,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:02:06,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:02:06,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:02:06,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:02:06,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:02:06,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:02:06,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:02:06,552 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_71aa1eda-70b3-40a0-b0f5-70602771e90b/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_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 -> 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 [2024-11-08 17:02:06,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:02:06,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:02:06,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:02:06,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:02:06,976 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:02:06,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i Unable to find full path for "g++" [2024-11-08 17:02:09,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:02:09,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:02:09,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2024-11-08 17:02:09,758 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data/7d4bc6142/8bb614d383a14e7f8769b7261d5a19d1/FLAGca50a6bb9 [2024-11-08 17:02:10,066 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data/7d4bc6142/8bb614d383a14e7f8769b7261d5a19d1 [2024-11-08 17:02:10,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:02:10,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:02:10,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:10,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:02:10,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:02:10,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b98bf9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10, skipping insertion in model container [2024-11-08 17:02:10,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:02:10,343 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_71aa1eda-70b3-40a0-b0f5-70602771e90b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2024-11-08 17:02:10,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:10,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:02:10,475 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_71aa1eda-70b3-40a0-b0f5-70602771e90b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2024-11-08 17:02:10,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:10,594 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:02:10,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10 WrapperNode [2024-11-08 17:02:10,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:10,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:02:10,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:02:10,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:02:10,607 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:02:10" (1/1) ... [2024-11-08 17:02:10,626 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:02:10" (1/1) ... [2024-11-08 17:02:10,691 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 543 [2024-11-08 17:02:10,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:02:10,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:02:10,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:02:10,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:02:10,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,752 INFO L175 MemorySlicer]: Split 138 memory accesses to 7 slices as follows [2, 24, 67, 9, 30, 3, 3]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 1, 5, 1, 1]. The 18 writes are split as follows [0, 4, 6, 1, 5, 1, 1]. [2024-11-08 17:02:10,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:02:10,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:02:10,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:02:10,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:02:10,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (1/1) ... [2024-11-08 17:02:10,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:10,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:10,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:02:10,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:02:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:02:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:02:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:02:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:02:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:02:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:02:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 17:02:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 17:02:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:02:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:02:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:02:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:02:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:02:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 17:02:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 17:02:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:02:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:02:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:02:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:02:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:02:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 17:02:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 17:02:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:02:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:02:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:02:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:02:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:02:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 17:02:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 17:02:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:02:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:02:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:02:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:02:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:02:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 17:02:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 17:02:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:02:10,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:02:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:02:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:02:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:02:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:02:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:02:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 17:02:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 17:02:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:02:10,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:02:11,264 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:02:11,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:02:11,970 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-08 17:02:11,970 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:02:11,989 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:02:11,990 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:02:11,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:11 BoogieIcfgContainer [2024-11-08 17:02:11,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:02:11,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:02:11,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:02:11,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:02:11,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:02:10" (1/3) ... [2024-11-08 17:02:12,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2074f558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:02:11, skipping insertion in model container [2024-11-08 17:02:12,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:10" (2/3) ... [2024-11-08 17:02:12,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2074f558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:02:12, skipping insertion in model container [2024-11-08 17:02:12,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:11" (3/3) ... [2024-11-08 17:02:12,002 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-72.i [2024-11-08 17:02:12,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:02:12,024 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:02:12,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:02:12,112 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;@29029c56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:02:12,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:02:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 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:02:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:02:12,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:12,138 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:12,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:12,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1019435807, now seen corresponding path program 1 times [2024-11-08 17:02:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782206009] [2024-11-08 17:02:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:02:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:02:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:02:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:02:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:02:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:02:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:02:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:02:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:02:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:02:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:02:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:02:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:02:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:02:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:02:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:02:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:02:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:12,790 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:02:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:02:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782206009] [2024-11-08 17:02:12,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782206009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:12,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:12,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:02:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763029743] [2024-11-08 17:02:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:02:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:02:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:02:12,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:02:12,835 INFO L87 Difference]: Start difference. First operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 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 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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:02:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:12,883 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2024-11-08 17:02:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:02:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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 149 [2024-11-08 17:02:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:12,896 INFO L225 Difference]: With dead ends: 249 [2024-11-08 17:02:12,897 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 17:02:12,901 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:02:12,906 INFO L432 NwaCegarLoop]: 180 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, 180 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:02:12,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:02:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 17:02:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-08 17:02:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 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:02:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2024-11-08 17:02:12,980 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 149 [2024-11-08 17:02:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:12,981 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2024-11-08 17:02:12,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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:02:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2024-11-08 17:02:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:02:12,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:12,992 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:12,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:02:12,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:12,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1689462407, now seen corresponding path program 1 times [2024-11-08 17:02:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601976734] [2024-11-08 17:02:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:02:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:02:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:02:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:02:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:02:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:02:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:02:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:02:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:02:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:02:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:02:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:02:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:02:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:02:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:02:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:02:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:02:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:13,697 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:02:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:02:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601976734] [2024-11-08 17:02:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601976734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:13,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:02:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656747713] [2024-11-08 17:02:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:02:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:02:13,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:02:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:02:13,706 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:02:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:13,785 INFO L93 Difference]: Finished difference Result 247 states and 360 transitions. [2024-11-08 17:02:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:02:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 149 [2024-11-08 17:02:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:13,789 INFO L225 Difference]: With dead ends: 247 [2024-11-08 17:02:13,789 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 17:02:13,790 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:02:13,792 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 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:02:13,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:02:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 17:02:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 17:02:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 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:02:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-08 17:02:13,820 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 149 [2024-11-08 17:02:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-08 17:02:13,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:02:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-11-08 17:02:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:02:13,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:13,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:13,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:02:13,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:13,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1496837038, now seen corresponding path program 1 times [2024-11-08 17:02:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:13,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312622707] [2024-11-08 17:02:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:02:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:02:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:02:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:02:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:02:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:02:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:02:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:02:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:02:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:02:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:02:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:02:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:02:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:02:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:02:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:02:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:02:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,179 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:02:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:02:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312622707] [2024-11-08 17:02:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312622707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:02:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711975116] [2024-11-08 17:02:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:02:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:02:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:02:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:02:14,188 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:02:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:14,266 INFO L93 Difference]: Finished difference Result 252 states and 365 transitions. [2024-11-08 17:02:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:02:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 151 [2024-11-08 17:02:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:14,273 INFO L225 Difference]: With dead ends: 252 [2024-11-08 17:02:14,273 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 17:02:14,277 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:02:14,278 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:14,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:02:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 17:02:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-08 17:02:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 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:02:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2024-11-08 17:02:14,295 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 151 [2024-11-08 17:02:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:14,296 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2024-11-08 17:02:14,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:02:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2024-11-08 17:02:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:02:14,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:14,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:02:14,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -816778668, now seen corresponding path program 1 times [2024-11-08 17:02:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271414855] [2024-11-08 17:02:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:02:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:02:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:02:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:02:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:02:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:02:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:02:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:02:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:02:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:02:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:02:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:02:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:02:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:02:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:02:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:02:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:02:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,592 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:02:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:02:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271414855] [2024-11-08 17:02:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271414855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:02:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136153374] [2024-11-08 17:02:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:02:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:02:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:02:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:02:14,597 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:02:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:14,645 INFO L93 Difference]: Finished difference Result 256 states and 369 transitions. [2024-11-08 17:02:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:02:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 151 [2024-11-08 17:02:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:14,650 INFO L225 Difference]: With dead ends: 256 [2024-11-08 17:02:14,650 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 17:02:14,655 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:02:14,657 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:14,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:02:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 17:02:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-08 17:02:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 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:02:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2024-11-08 17:02:14,683 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 151 [2024-11-08 17:02:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2024-11-08 17:02:14,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:02:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2024-11-08 17:02:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:02:14,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:14,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:14,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:02:14,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:14,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 958228694, now seen corresponding path program 1 times [2024-11-08 17:02:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:14,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436146477] [2024-11-08 17:02:14,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:02:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:02:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:02:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:02:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:02:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:02:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:02:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:02:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:02:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:02:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:02:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:02:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:02:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:02:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:02:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:02:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:02:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:15,003 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:02:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:02:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436146477] [2024-11-08 17:02:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436146477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:02:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814997977] [2024-11-08 17:02:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:02:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:02:15,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:02:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:02:15,006 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:02:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:15,051 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2024-11-08 17:02:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:02:15,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 151 [2024-11-08 17:02:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:15,054 INFO L225 Difference]: With dead ends: 260 [2024-11-08 17:02:15,056 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 17:02:15,056 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:02:15,058 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:15,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:02:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 17:02:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-08 17:02:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 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:02:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-11-08 17:02:15,081 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 151 [2024-11-08 17:02:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-11-08 17:02:15,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:02:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-11-08 17:02:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:02:15,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:15,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:02:15,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:15,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 960075736, now seen corresponding path program 1 times [2024-11-08 17:02:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487620087] [2024-11-08 17:02:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:02:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:02:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:02:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:02:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:02:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:02:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:02:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:02:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:02:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:02:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:02:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:02:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:02:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:02:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:02:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:02:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:02:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 17:02:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:02:16,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487620087] [2024-11-08 17:02:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487620087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:02:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548159504] [2024-11-08 17:02:16,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:16,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:02:16,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:02:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:16,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:02:17,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:02:17,136 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 29 treesize of output 13 [2024-11-08 17:02:17,241 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 29 treesize of output 13 [2024-11-08 17:02:17,700 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 17 treesize of output 9 [2024-11-08 17:02:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-08 17:02:17,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:02:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 17:02:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548159504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:02:18,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:02:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-08 17:02:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940064967] [2024-11-08 17:02:18,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:02:18,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:02:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:02:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:02:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:02:18,296 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-08 17:02:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:18,733 INFO L93 Difference]: Finished difference Result 269 states and 380 transitions. [2024-11-08 17:02:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:02:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 4 states have call successors, (33) Word has length 151 [2024-11-08 17:02:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:18,735 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:02:18,736 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 17:02:18,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 330 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:02:18,738 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 442 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:18,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 668 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:02:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 17:02:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-11-08 17:02:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 17:02:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2024-11-08 17:02:18,752 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 151 [2024-11-08 17:02:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:18,753 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2024-11-08 17:02:18,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-08 17:02:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2024-11-08 17:02:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:02:18,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:18,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:18,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:02:18,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:18,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:02:18,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1661675610, now seen corresponding path program 1 times [2024-11-08 17:02:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:02:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690445119] [2024-11-08 17:02:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:02:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:02:19,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:02:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:02:19,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:02:19,272 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:02:19,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:02:19,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:02:19,280 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:19,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:02:19,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:02:19 BoogieIcfgContainer [2024-11-08 17:02:19,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:02:19,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:02:19,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:02:19,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:02:19,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:11" (3/4) ... [2024-11-08 17:02:19,416 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:02:19,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:02:19,419 INFO L158 Benchmark]: Toolchain (without parser) took 9346.81ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 137.1MB in the beginning and 77.1MB in the end (delta: 60.0MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2024-11-08 17:02:19,419 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:02:19,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.81ms. Allocated memory is still 165.7MB. Free memory was 136.9MB in the beginning and 121.0MB in the end (delta: 15.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-08 17:02:19,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.77ms. Allocated memory is still 165.7MB. Free memory was 121.0MB in the beginning and 117.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:02:19,421 INFO L158 Benchmark]: Boogie Preprocessor took 111.63ms. Allocated memory is still 165.7MB. Free memory was 117.6MB in the beginning and 112.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:02:19,421 INFO L158 Benchmark]: RCFGBuilder took 1185.42ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 98.8MB in the end (delta: 13.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 17:02:19,421 INFO L158 Benchmark]: TraceAbstraction took 7417.26ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 98.3MB in the beginning and 77.1MB in the end (delta: 21.3MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-11-08 17:02:19,422 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 245.4MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:02:19,424 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.81ms. Allocated memory is still 165.7MB. Free memory was 136.9MB in the beginning and 121.0MB in the end (delta: 15.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.77ms. Allocated memory is still 165.7MB. Free memory was 121.0MB in the beginning and 117.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.63ms. Allocated memory is still 165.7MB. Free memory was 117.6MB in the beginning and 112.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1185.42ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 98.8MB in the end (delta: 13.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7417.26ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 98.3MB in the beginning and 77.1MB in the end (delta: 21.3MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 245.4MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L28-L30] float float_Array_0[1] = { 0.25 }; [L28-L30] float float_Array_0[1] = { 0.25 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 2 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 10000 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 10000 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 1; [L41] double last_1_double_Array_0_2_ = 256.4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR BOOL_unsigned_char_Array_0[1][1] [L93] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L94] EXPR double_Array_0[2] [L94] last_1_double_Array_0_2_ = double_Array_0[2] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[1] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[1] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L74] EXPR double_Array_0[1] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] 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 [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(float_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(float_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET updateVariables() [L106] CALL step() [L45] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L48] EXPR signed_char_Array_0[0] [L48] EXPR signed_char_Array_0[1] [L48] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] EXPR (((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])) [L48] EXPR signed_char_Array_0[0] [L48] EXPR signed_char_Array_0[1] [L48] EXPR (((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] signed_char_Array_0[3] = (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))) [L49] EXPR double_Array_0[4] [L49] double_Array_0[0] = double_Array_0[4] [L50] signed_char_Array_0[2] = 1 [L51] unsigned_short_int_Array_0[0] = 10 [L52] EXPR double_Array_0[0] [L52] EXPR double_Array_0[0] [L52] EXPR float_Array_0[0] [L52] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND FALSE !((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] EXPR double_Array_0[2] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) [L59] EXPR double_Array_0[2] [L59] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND FALSE !(double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR double_Array_0[0] [L97] EXPR double_Array_0[2] [L97] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) [L97] EXPR double_Array_0[2] [L97] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1 [L97] EXPR BOOL_unsigned_char_Array_0[1][1] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97-L98] return (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 2935 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1901 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1034 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 528 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=6, InterpolantAutomatonStates: 30, 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, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1196 ConstructedInterpolants, 0 QuantifiedInterpolants, 2837 SizeOfPredicates, 4 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 4217/4352 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:02:19,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:02:22,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:02:22,551 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:02:22,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:02:22,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:02:22,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:02:22,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:02:22,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:02:22,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:02:22,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:02:22,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:02:22,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:02:22,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:02:22,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:02:22,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:02:22,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:02:22,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:02:22,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:02:22,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:02:22,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:02:22,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:02:22,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:02:22,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:02:22,629 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:02:22,629 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:02:22,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:02:22,630 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:02:22,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:02:22,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:02:22,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:02:22,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:02:22,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:02:22,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:02:22,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:02:22,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:22,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:02:22,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:02:22,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:02:22,638 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:02:22,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:02:22,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:02:22,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:02:22,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:02:22,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:02:22,640 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_71aa1eda-70b3-40a0-b0f5-70602771e90b/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_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 -> 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 [2024-11-08 17:02:23,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:02:23,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:02:23,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:02:23,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:02:23,194 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:02:23,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i Unable to find full path for "g++" [2024-11-08 17:02:25,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:02:25,973 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:02:25,974 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2024-11-08 17:02:25,993 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data/4470c40ed/48bcc8f1e69b48b48ae9bd75e15a78e3/FLAG9730982ab [2024-11-08 17:02:26,274 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/data/4470c40ed/48bcc8f1e69b48b48ae9bd75e15a78e3 [2024-11-08 17:02:26,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:02:26,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:02:26,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:26,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:02:26,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:02:26,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:26,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74195c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26, skipping insertion in model container [2024-11-08 17:02:26,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:26,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:02:26,630 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_71aa1eda-70b3-40a0-b0f5-70602771e90b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2024-11-08 17:02:26,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:26,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:02:26,771 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_71aa1eda-70b3-40a0-b0f5-70602771e90b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2024-11-08 17:02:26,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:26,899 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:02:26,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26 WrapperNode [2024-11-08 17:02:26,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:26,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:02:26,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:02:26,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:02:26,912 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:02:26" (1/1) ... [2024-11-08 17:02:26,943 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:02:26" (1/1) ... [2024-11-08 17:02:26,996 INFO L138 Inliner]: procedures = 39, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 540 [2024-11-08 17:02:26,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:02:26,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:02:26,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:02:26,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:02:27,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,050 INFO L175 MemorySlicer]: Split 138 memory accesses to 7 slices as follows [2, 24, 67, 9, 30, 3, 3]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 1, 5, 1, 1]. The 18 writes are split as follows [0, 4, 6, 1, 5, 1, 1]. [2024-11-08 17:02:27,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:02:27,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:02:27,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:02:27,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:02:27,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (1/1) ... [2024-11-08 17:02:27,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:27,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:27,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:02:27,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:02:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:02:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 17:02:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 17:02:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 17:02:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 17:02:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 17:02:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 17:02:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-08 17:02:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 17:02:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 17:02:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 17:02:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 17:02:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 17:02:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 17:02:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-08 17:02:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:02:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:02:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:02:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:02:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:02:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 17:02:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 17:02:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 17:02:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 17:02:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 17:02:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 17:02:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 17:02:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 17:02:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 17:02:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:02:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:02:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:02:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:02:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:02:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 17:02:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 17:02:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:02:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:02:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:02:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:02:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:02:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 17:02:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 17:02:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:02:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:02:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:02:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:02:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 17:02:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 17:02:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-08 17:02:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 17:02:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 17:02:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 17:02:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 17:02:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 17:02:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 17:02:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-08 17:02:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:02:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:02:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:02:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:02:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:02:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 17:02:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 17:02:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:02:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:02:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 17:02:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 17:02:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 17:02:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 17:02:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 17:02:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:02:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:02:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:02:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:02:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 17:02:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 17:02:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-08 17:02:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:02:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:02:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:02:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:02:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 17:02:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 17:02:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-08 17:02:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:02:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:02:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:02:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:02:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:02:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:02:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:02:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:02:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:02:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 17:02:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 17:02:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:02:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:02:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 17:02:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 17:02:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 17:02:27,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 17:02:27,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 17:02:27,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:02:27,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:02:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:02:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:02:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:02:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 17:02:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 17:02:27,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:02:27,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:03:02,060 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-08 17:03:02,060 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:03:02,083 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:03:02,083 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:03:02,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:03:02 BoogieIcfgContainer [2024-11-08 17:03:02,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:03:02,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:03:02,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:03:02,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:03:02,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:02:26" (1/3) ... [2024-11-08 17:03:02,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@914cb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:03:02, skipping insertion in model container [2024-11-08 17:03:02,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:26" (2/3) ... [2024-11-08 17:03:02,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@914cb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:03:02, skipping insertion in model container [2024-11-08 17:03:02,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:03:02" (3/3) ... [2024-11-08 17:03:02,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-72.i [2024-11-08 17:03:02,122 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:03:02,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:03:02,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:03:02,222 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;@5b21906d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:03:02,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:03:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 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:03:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:03:02,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:02,249 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:02,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:03:02,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1019435807, now seen corresponding path program 1 times [2024-11-08 17:03:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776717877] [2024-11-08 17:03:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:02,284 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:03:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:03:02,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:02,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:04,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:03:04,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:04,555 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:03:04,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:04,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776717877] [2024-11-08 17:03:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776717877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:04,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:03:04,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164732176] [2024-11-08 17:03:04,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:04,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:03:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:04,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:03:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:03:04,613 INFO L87 Difference]: Start difference. First operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 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 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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:03:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:04,662 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2024-11-08 17:03:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:03:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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 149 [2024-11-08 17:03:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:04,678 INFO L225 Difference]: With dead ends: 249 [2024-11-08 17:03:04,679 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 17:03:04,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:03:04,687 INFO L432 NwaCegarLoop]: 180 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, 180 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:03:04,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:03:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 17:03:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-08 17:03:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 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:03:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2024-11-08 17:03:04,782 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 149 [2024-11-08 17:03:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2024-11-08 17:03:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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:03:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2024-11-08 17:03:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:03:04,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:04,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:04,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:04,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:03:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1689462407, now seen corresponding path program 1 times [2024-11-08 17:03:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328103518] [2024-11-08 17:03:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:04,993 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:03:04,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:03:04,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:04,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:06,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:03:06,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:07,238 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:03:07,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:07,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328103518] [2024-11-08 17:03:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328103518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:07,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:07,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021575185] [2024-11-08 17:03:07,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:07,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:07,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:07,252 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:03:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:07,513 INFO L93 Difference]: Finished difference Result 247 states and 360 transitions. [2024-11-08 17:03:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:07,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 149 [2024-11-08 17:03:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:07,517 INFO L225 Difference]: With dead ends: 247 [2024-11-08 17:03:07,521 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 17:03:07,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:07,523 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:07,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:03:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 17:03:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 17:03:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 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:03:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-08 17:03:07,556 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 149 [2024-11-08 17:03:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:07,561 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-08 17:03:07,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:03:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-11-08 17:03:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:03:07,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:07,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:07,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:07,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:07,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:03:07,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1496837038, now seen corresponding path program 1 times [2024-11-08 17:03:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:07,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241951150] [2024-11-08 17:03:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:07,772 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:03:07,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:03:07,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:07,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:09,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:03:09,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:10,134 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:03:10,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:10,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241951150] [2024-11-08 17:03:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241951150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:10,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:10,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:03:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552213952] [2024-11-08 17:03:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:10,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:03:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:10,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:03:10,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:10,140 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:03:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:10,696 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2024-11-08 17:03:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:03:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 151 [2024-11-08 17:03:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:10,700 INFO L225 Difference]: With dead ends: 256 [2024-11-08 17:03:10,700 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 17:03:10,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:10,703 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:10,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 844 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:03:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 17:03:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-08 17:03:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 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:03:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-11-08 17:03:10,718 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 151 [2024-11-08 17:03:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:10,719 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-11-08 17:03:10,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:03:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-11-08 17:03:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:03:10,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:10,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:10,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:10,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:10,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:03:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash -816778668, now seen corresponding path program 1 times [2024-11-08 17:03:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674654501] [2024-11-08 17:03:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:10,928 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:03:10,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:03:10,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:10,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:12,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:03:12,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:13,383 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:03:13,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:13,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674654501] [2024-11-08 17:03:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674654501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:03:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117780918] [2024-11-08 17:03:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:03:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:03:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:03:13,389 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:03:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:14,097 INFO L93 Difference]: Finished difference Result 264 states and 377 transitions. [2024-11-08 17:03:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:03:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 151 [2024-11-08 17:03:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:14,102 INFO L225 Difference]: With dead ends: 264 [2024-11-08 17:03:14,104 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 17:03:14,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:03:14,106 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:14,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:03:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 17:03:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-08 17:03:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 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:03:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-08 17:03:14,138 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 151 [2024-11-08 17:03:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:14,142 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-08 17:03:14,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:03:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-08 17:03:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:03:14,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:14,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:14,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:14,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:03:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash 958228694, now seen corresponding path program 1 times [2024-11-08 17:03:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608849116] [2024-11-08 17:03:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:14,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:03:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:03:14,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:14,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:16,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:03:16,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:17,017 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:03:17,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:17,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:17,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608849116] [2024-11-08 17:03:17,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608849116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:17,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:17,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:03:17,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356177141] [2024-11-08 17:03:17,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:17,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:03:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:03:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:03:17,021 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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:03:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:17,797 INFO L93 Difference]: Finished difference Result 268 states and 381 transitions. [2024-11-08 17:03:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:03:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 151 [2024-11-08 17:03:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:17,801 INFO L225 Difference]: With dead ends: 268 [2024-11-08 17:03:17,802 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:03:17,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:03:17,807 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:17,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1160 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:03:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:03:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-08 17:03:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 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:03:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-11-08 17:03:17,837 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 151 [2024-11-08 17:03:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:17,838 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-11-08 17:03:17,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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:03:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-11-08 17:03:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:03:17,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:17,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:17,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:18,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:18,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:03:18,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash 960075736, now seen corresponding path program 1 times [2024-11-08 17:03:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911361142] [2024-11-08 17:03:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:18,045 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:03:18,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:03:18,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:18,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:03:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:19,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:03:19,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:21,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:03:21,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 17:03:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 17:03:21,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:21,237 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:21,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911361142] [2024-11-08 17:03:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911361142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:21,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:21,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:03:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448911413] [2024-11-08 17:03:21,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:21,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:03:21,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:03:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:21,241 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 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:03:27,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:31,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:35,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:39,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:43,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:47,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:51,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:03:55,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:01,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:05,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:09,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:11,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:15,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:18,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:23,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:27,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:31,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:35,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:37,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:38,096 INFO L93 Difference]: Finished difference Result 270 states and 382 transitions. [2024-11-08 17:04:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:04:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 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 151 [2024-11-08 17:04:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:38,108 INFO L225 Difference]: With dead ends: 270 [2024-11-08 17:04:38,108 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:04:38,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:04:38,110 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 154 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:38,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 513 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 14 Unknown, 0 Unchecked, 76.6s Time] [2024-11-08 17:04:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:04:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-08 17:04:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 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:04:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2024-11-08 17:04:38,122 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 191 transitions. Word has length 151 [2024-11-08 17:04:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:38,123 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 191 transitions. [2024-11-08 17:04:38,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 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:04:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2024-11-08 17:04:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:04:38,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:04:38,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:04:38,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:04:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash 474204594, now seen corresponding path program 1 times [2024-11-08 17:04:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:04:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555057919] [2024-11-08 17:04:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:38,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:04:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:04:38,334 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:04:38,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 [2024-11-08 17:04:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:40,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:04:40,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:41,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:04:41,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 17:04:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:04:41,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:04:41,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:04:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555057919] [2024-11-08 17:04:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555057919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:04:41,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:04:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:04:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165922496] [2024-11-08 17:04:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:04:41,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:04:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:04:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:04:41,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:04:41,468 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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:04:47,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:51,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:55,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:04:59,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:03,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:07,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:11,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:15,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:21,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:24,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:26,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:28,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:30,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:34,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:38,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:42,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:46,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:50,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:55,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:05:59,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:03,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:07,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:09,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:06:10,271 INFO L93 Difference]: Finished difference Result 270 states and 380 transitions. [2024-11-08 17:06:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:06:10,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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 153 [2024-11-08 17:06:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:06:10,281 INFO L225 Difference]: With dead ends: 270 [2024-11-08 17:06:10,281 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:06:10,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:06:10,282 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 145 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:06:10,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 17 Unknown, 0 Unchecked, 88.5s Time] [2024-11-08 17:06:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:06:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-08 17:06:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 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:06:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2024-11-08 17:06:10,293 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 153 [2024-11-08 17:06:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:06:10,293 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2024-11-08 17:06:10,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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:06:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2024-11-08 17:06:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:06:10,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:06:10,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:06:10,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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)] Ended with exit code 0 [2024-11-08 17:06:10,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:06:10,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:06:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:06:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2027853544, now seen corresponding path program 1 times [2024-11-08 17:06:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:06:10,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137189181] [2024-11-08 17:06:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:10,500 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:06:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:06:10,503 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:06:10,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (9)] Waiting until timeout for monitored process [2024-11-08 17:06:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:12,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:06:12,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:06:13,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:06:13,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 17:06:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-08 17:06:13,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:06:13,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:06:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137189181] [2024-11-08 17:06:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137189181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:06:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:06:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:06:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665633028] [2024-11-08 17:06:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:06:13,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:06:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:06:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:06:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:06:13,607 INFO L87 Difference]: Start difference. First operand 136 states and 190 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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:06:19,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:23,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:27,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:31,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:35,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:39,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:43,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:47,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:51,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:53,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:56,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:06:59,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:03,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:07,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:11,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:15,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:20,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:24,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:28,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:32,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:07:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:07:33,984 INFO L93 Difference]: Finished difference Result 270 states and 378 transitions. [2024-11-08 17:07:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:07:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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 155 [2024-11-08 17:07:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:07:33,991 INFO L225 Difference]: With dead ends: 270 [2024-11-08 17:07:33,991 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:07:33,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:07:33,992 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 135 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:07:33,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 505 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 80.2s Time] [2024-11-08 17:07:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:07:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-08 17:07:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 117 states have internal predecessors, (155), 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:07:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-11-08 17:07:34,001 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 155 [2024-11-08 17:07:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:07:34,002 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-11-08 17:07:34,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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:07:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-11-08 17:07:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:07:34,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:07:34,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:07:34,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (9)] Ended with exit code 0 [2024-11-08 17:07:34,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:07:34,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:07:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:07:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 206373106, now seen corresponding path program 1 times [2024-11-08 17:07:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:07:34,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844281684] [2024-11-08 17:07:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:07:34,207 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:07:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:07:34,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:07:34,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (10)] Waiting until timeout for monitored process [2024-11-08 17:07:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:07:36,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:07:36,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:07:36,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:07:36,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 31 [2024-11-08 17:07:36,349 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:07:36,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:07:36,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:07:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844281684] [2024-11-08 17:07:36,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844281684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:07:36,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:07:36,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:07:36,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690586043] [2024-11-08 17:07:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:07:36,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:07:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:07:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:07:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:07:36,352 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:07:40,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:07:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:07:41,330 INFO L93 Difference]: Finished difference Result 269 states and 375 transitions. [2024-11-08 17:07:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:07:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 157 [2024-11-08 17:07:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:07:41,334 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:07:41,334 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 17:07:41,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:07:41,336 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:07:41,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-11-08 17:07:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 17:07:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-08 17:07:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 117 states have internal predecessors, (154), 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:07:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-08 17:07:41,346 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 157 [2024-11-08 17:07:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:07:41,346 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-08 17:07:41,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:07:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-08 17:07:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:07:41,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:07:41,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:07:41,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:07:41,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:07:41,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:07:41,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:07:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 346921716, now seen corresponding path program 1 times [2024-11-08 17:07:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:07:41,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835905824] [2024-11-08 17:07:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:07:41,555 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:07:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:07:41,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:07:41,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (11)] Waiting until timeout for monitored process [2024-11-08 17:07:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:07:43,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:07:43,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:07:43,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:07:43,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 31 [2024-11-08 17:07:43,792 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:07:43,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:07:43,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:07:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835905824] [2024-11-08 17:07:43,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835905824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:07:43,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:07:43,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:07:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738607938] [2024-11-08 17:07:43,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:07:43,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:07:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:07:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:07:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:07:43,796 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:07:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:07:43,891 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2024-11-08 17:07:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:07:43,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 157 [2024-11-08 17:07:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:07:43,893 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:07:43,893 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 17:07:43,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:07:43,894 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:07:43,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:07:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 17:07:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-08 17:07:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 117 states have internal predecessors, (153), 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:07:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 187 transitions. [2024-11-08 17:07:43,901 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 187 transitions. Word has length 157 [2024-11-08 17:07:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:07:43,901 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 187 transitions. [2024-11-08 17:07:43,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:07:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 187 transitions. [2024-11-08 17:07:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:07:43,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:07:43,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:07:43,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (11)] Forceful destruction successful, exit code 0 [2024-11-08 17:07:44,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:07:44,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:07:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:07:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 769623542, now seen corresponding path program 1 times [2024-11-08 17:07:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:07:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172997193] [2024-11-08 17:07:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:07:44,105 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:07:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:07:44,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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:07:44,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71aa1eda-70b3-40a0-b0f5-70602771e90b/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 (12)] Waiting until timeout for monitored process