./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1 --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 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:38:56,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:38:56,837 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:38:56,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:38:56,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:38:56,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:38:56,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:38:56,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:38:56,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:38:56,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:38:56,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:38:56,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:38:56,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:38:56,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:38:56,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:38:56,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:38:56,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:38:56,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:38:56,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:38:56,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:38:56,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:38:56,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:38:56,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1 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 -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2024-12-02 14:38:57,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:38:57,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:38:57,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:38:57,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:38:57,104 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:38:57,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-12-02 14:38:59,711 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/242ba3c75/7ef36eb63eb244e18b26fbb68c1e4325/FLAG1b2aa3d3e [2024-12-02 14:38:59,927 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:38:59,928 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-12-02 14:38:59,934 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/242ba3c75/7ef36eb63eb244e18b26fbb68c1e4325/FLAG1b2aa3d3e [2024-12-02 14:39:00,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/242ba3c75/7ef36eb63eb244e18b26fbb68c1e4325 [2024-12-02 14:39:00,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:39:00,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:39:00,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:39:00,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:39:00,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:39:00,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a3a284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00, skipping insertion in model container [2024-12-02 14:39:00,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:39:00,415 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_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2024-12-02 14:39:00,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:39:00,506 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:39:00,514 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_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2024-12-02 14:39:00,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:39:00,582 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:39:00,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00 WrapperNode [2024-12-02 14:39:00,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:39:00,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:39:00,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:39:00,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:39:00,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,642 INFO L138 Inliner]: procedures = 29, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 769 [2024-12-02 14:39:00,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:39:00,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:39:00,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:39:00,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:39:00,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,681 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2024-12-02 14:39:00,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:39:00,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:39:00,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:39:00,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:39:00,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (1/1) ... [2024-12-02 14:39:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:39:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:00,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:39:00,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-12-02 14:39:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 14:39:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 14:39:00,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 14:39:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:39:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 14:39:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 14:39:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-12-02 14:39:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-12-02 14:39:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-12-02 14:39:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:39:00,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:39:00,911 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:39:00,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:39:01,510 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-12-02 14:39:01,510 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:39:01,521 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:39:01,522 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 14:39:01,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:01 BoogieIcfgContainer [2024-12-02 14:39:01,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:39:01,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:39:01,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:39:01,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:39:01,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:39:00" (1/3) ... [2024-12-02 14:39:01,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4517adf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:39:01, skipping insertion in model container [2024-12-02 14:39:01,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:00" (2/3) ... [2024-12-02 14:39:01,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4517adf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:39:01, skipping insertion in model container [2024-12-02 14:39:01,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:01" (3/3) ... [2024-12-02 14:39:01,530 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2024-12-02 14:39:01,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:39:01,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-86.i that has 2 procedures, 159 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 14:39:01,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:39:01,609 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;@141b0fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:39:01,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:39:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 132 states have internal predecessors, (188), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-02 14:39:01,623 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:01,624 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:01,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:01,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1797929157, now seen corresponding path program 1 times [2024-12-02 14:39:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798399384] [2024-12-02 14:39:01,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-12-02 14:39:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798399384] [2024-12-02 14:39:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798399384] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006062059] [2024-12-02 14:39:01,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:01,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:01,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:01,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:01,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:39:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:02,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 14:39:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-12-02 14:39:02,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:02,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006062059] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:02,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:39:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 14:39:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629799563] [2024-12-02 14:39:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:02,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 14:39:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:02,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 14:39:02,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 14:39:02,258 INFO L87 Difference]: Start difference. First operand has 159 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 132 states have internal predecessors, (188), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:02,287 INFO L93 Difference]: Finished difference Result 311 states and 495 transitions. [2024-12-02 14:39:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 14:39:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-12-02 14:39:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:02,295 INFO L225 Difference]: With dead ends: 311 [2024-12-02 14:39:02,295 INFO L226 Difference]: Without dead ends: 155 [2024-12-02 14:39:02,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-12-02 14:39:02,301 INFO L435 NwaCegarLoop]: 231 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, 231 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-12-02 14:39:02,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-12-02 14:39:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-12-02 14:39:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-12-02 14:39:02,340 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 185 [2024-12-02 14:39:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:02,340 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-12-02 14:39:02,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-12-02 14:39:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-02 14:39:02,343 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:02,343 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:02,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:39:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-02 14:39:02,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:02,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 953519139, now seen corresponding path program 1 times [2024-12-02 14:39:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424458448] [2024-12-02 14:39:02,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424458448] [2024-12-02 14:39:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424458448] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:39:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792540153] [2024-12-02 14:39:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:02,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:39:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:02,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:39:02,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:39:02,847 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:02,892 INFO L93 Difference]: Finished difference Result 309 states and 462 transitions. [2024-12-02 14:39:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:39:02,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-12-02 14:39:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:02,894 INFO L225 Difference]: With dead ends: 309 [2024-12-02 14:39:02,895 INFO L226 Difference]: Without dead ends: 157 [2024-12-02 14:39:02,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 14:39:02,896 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 676 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-12-02 14:39:02,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 676 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-12-02 14:39:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-12-02 14:39:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-12-02 14:39:02,910 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 185 [2024-12-02 14:39:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:02,911 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-12-02 14:39:02,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-12-02 14:39:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-02 14:39:02,915 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:02,915 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:39:02,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1205564955, now seen corresponding path program 1 times [2024-12-02 14:39:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135217514] [2024-12-02 14:39:02,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135217514] [2024-12-02 14:39:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135217514] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:39:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908238897] [2024-12-02 14:39:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:03,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:39:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:03,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:39:03,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:39:03,171 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:03,204 INFO L93 Difference]: Finished difference Result 314 states and 467 transitions. [2024-12-02 14:39:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:39:03,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-12-02 14:39:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:03,206 INFO L225 Difference]: With dead ends: 314 [2024-12-02 14:39:03,207 INFO L226 Difference]: Without dead ends: 160 [2024-12-02 14:39:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 14:39:03,208 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 675 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-12-02 14:39:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2024-12-02 14:39:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 132 states have internal predecessors, (185), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 235 transitions. [2024-12-02 14:39:03,220 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 235 transitions. Word has length 185 [2024-12-02 14:39:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:03,221 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 235 transitions. [2024-12-02 14:39:03,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 235 transitions. [2024-12-02 14:39:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-02 14:39:03,224 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:03,224 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:03,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:39:03,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1203717913, now seen corresponding path program 1 times [2024-12-02 14:39:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:03,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877088380] [2024-12-02 14:39:03,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877088380] [2024-12-02 14:39:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877088380] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723192751] [2024-12-02 14:39:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:39:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:04,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:39:04,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:39:04,039 INFO L87 Difference]: Start difference. First operand 159 states and 235 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:04,161 INFO L93 Difference]: Finished difference Result 437 states and 648 transitions. [2024-12-02 14:39:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:39:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-12-02 14:39:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:04,164 INFO L225 Difference]: With dead ends: 437 [2024-12-02 14:39:04,164 INFO L226 Difference]: Without dead ends: 281 [2024-12-02 14:39:04,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:04,165 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 166 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:04,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1024 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:39:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-12-02 14:39:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-12-02 14:39:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 241 states have (on average 1.4315352697095436) internal successors, (345), 242 states have internal predecessors, (345), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-12-02 14:39:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 413 transitions. [2024-12-02 14:39:04,184 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 413 transitions. Word has length 185 [2024-12-02 14:39:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:04,184 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 413 transitions. [2024-12-02 14:39:04,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 413 transitions. [2024-12-02 14:39:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-02 14:39:04,187 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:04,187 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:04,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:39:04,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash -136793502, now seen corresponding path program 1 times [2024-12-02 14:39:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885086267] [2024-12-02 14:39:04,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885086267] [2024-12-02 14:39:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885086267] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:39:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332975062] [2024-12-02 14:39:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:04,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:39:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:04,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:39:04,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:04,959 INFO L87 Difference]: Start difference. First operand 278 states and 413 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:05,091 INFO L93 Difference]: Finished difference Result 559 states and 827 transitions. [2024-12-02 14:39:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:39:05,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2024-12-02 14:39:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:05,095 INFO L225 Difference]: With dead ends: 559 [2024-12-02 14:39:05,095 INFO L226 Difference]: Without dead ends: 284 [2024-12-02 14:39:05,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:05,097 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 124 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:05,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:39:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-12-02 14:39:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2024-12-02 14:39:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 244 states have (on average 1.4221311475409837) internal successors, (347), 245 states have internal predecessors, (347), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-12-02 14:39:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 415 transitions. [2024-12-02 14:39:05,115 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 415 transitions. Word has length 187 [2024-12-02 14:39:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 415 transitions. [2024-12-02 14:39:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2024-12-02 14:39:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-02 14:39:05,118 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:05,118 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:05,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:39:05,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:05,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1857351204, now seen corresponding path program 1 times [2024-12-02 14:39:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487233117] [2024-12-02 14:39:05,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-12-02 14:39:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487233117] [2024-12-02 14:39:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487233117] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076005288] [2024-12-02 14:39:06,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:06,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:06,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:06,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:39:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:07,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 14:39:07,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:07,221 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 31 treesize of output 15 [2024-12-02 14:39:07,262 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 31 treesize of output 15 [2024-12-02 14:39:07,326 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 31 treesize of output 19 [2024-12-02 14:39:07,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 14:39:07,372 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 22 treesize of output 10 [2024-12-02 14:39:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 442 proven. 15 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2024-12-02 14:39:07,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-12-02 14:39:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076005288] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:07,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2024-12-02 14:39:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529495234] [2024-12-02 14:39:07,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-02 14:39:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-02 14:39:07,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-12-02 14:39:07,728 INFO L87 Difference]: Start difference. First operand 282 states and 415 transitions. Second operand has 21 states, 17 states have (on average 8.0) internal successors, (136), 21 states have internal predecessors, (136), 10 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 6 states have call predecessors, (56), 10 states have call successors, (56) [2024-12-02 14:39:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:09,422 INFO L93 Difference]: Finished difference Result 666 states and 966 transitions. [2024-12-02 14:39:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 14:39:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 21 states have internal predecessors, (136), 10 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 6 states have call predecessors, (56), 10 states have call successors, (56) Word has length 187 [2024-12-02 14:39:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:09,426 INFO L225 Difference]: With dead ends: 666 [2024-12-02 14:39:09,426 INFO L226 Difference]: Without dead ends: 387 [2024-12-02 14:39:09,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=484, Invalid=1586, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 14:39:09,428 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1031 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:09,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1270 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 14:39:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-12-02 14:39:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 366. [2024-12-02 14:39:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 299 states have (on average 1.3678929765886287) internal successors, (409), 301 states have internal predecessors, (409), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2024-12-02 14:39:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 527 transitions. [2024-12-02 14:39:09,455 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 527 transitions. Word has length 187 [2024-12-02 14:39:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:09,456 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 527 transitions. [2024-12-02 14:39:09,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 21 states have internal predecessors, (136), 10 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 6 states have call predecessors, (56), 10 states have call successors, (56) [2024-12-02 14:39:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 527 transitions. [2024-12-02 14:39:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-02 14:39:09,458 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:09,458 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:09,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:39:09,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:09,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1124360458, now seen corresponding path program 1 times [2024-12-02 14:39:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345622295] [2024-12-02 14:39:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:39:09,750 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:39:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:39:09,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:39:09,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:39:09,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 14:39:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:39:09,858 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:09,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:39:09,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:39:09 BoogieIcfgContainer [2024-12-02 14:39:09,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:39:09,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:39:09,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:39:09,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:39:09,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:01" (3/4) ... [2024-12-02 14:39:09,938 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 14:39:09,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:39:09,939 INFO L158 Benchmark]: Toolchain (without parser) took 9641.48ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 117.6MB in the beginning and 147.1MB in the end (delta: -29.5MB). Peak memory consumption was 234.1MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,939 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:39:09,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.68ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 98.6MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.82ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 92.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,940 INFO L158 Benchmark]: Boogie Preprocessor took 84.40ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 85.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,940 INFO L158 Benchmark]: RCFGBuilder took 794.18ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 94.2MB in the end (delta: -8.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,940 INFO L158 Benchmark]: TraceAbstraction took 8411.14ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 93.7MB in the beginning and 147.1MB in the end (delta: -53.5MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,941 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 402.7MB. Free memory was 147.1MB in the beginning and 147.1MB in the end (delta: 34.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:39:09,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.68ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 98.6MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.82ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 92.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.40ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 85.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 794.18ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 94.2MB in the end (delta: -8.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8411.14ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 93.7MB in the beginning and 147.1MB in the end (delta: -53.5MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 402.7MB. Free memory was 147.1MB in the beginning and 147.1MB in the end (delta: 34.6kB). Peak memory consumption was 8.4MB. 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 shiftLeft at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] isInitial = 1 [L109] FCALL initially() [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L61] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[0][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] float_Array_0[1][0] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[0][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L83] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L86] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L112] RET updateVariables() [L113] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1]) [L43] EXPR signed_short_int_Array_0[1] [L43] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L45] EXPR signed_short_int_Array_0[1] [L45] signed short int stepLocal_0 = signed_short_int_Array_0[1]; [L46] COND TRUE stepLocal_0 > 2 [L47] EXPR float_Array_0[1][0] [L47] EXPR float_Array_0[0][0] [L47] EXPR float_Array_0[0][1] [L47] float_Array_0[1][1] = ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]) [L49] EXPR unsigned_short_int_Array_0[1][1] [L49] unsigned_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[0] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) [L53] EXPR signed_short_int_Array_0[3] [L53] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR -25 << unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) [L56] EXPR unsigned_short_int_Array_0[1][1] [L56] EXPR unsigned_short_int_Array_0[1][2] [L56] unsigned_short_int_Array_0[1][0] = (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) [L104] EXPR signed_short_int_Array_0[4] [L104] EXPR signed_short_int_Array_0[1] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) [L104] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 [L104] EXPR float_Array_0[1][1] [L104] EXPR float_Array_0[1][0] [L104] EXPR float_Array_0[0][0] [L104] EXPR float_Array_0[0][1] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104-L105] return ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1323 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 4991 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3594 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1557 IncrementalHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 1397 mSDtfsCounter, 1557 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1664 ConstructedInterpolants, 0 QuantifiedInterpolants, 2931 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1208 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10707/10800 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 14:39:09,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1 --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 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:39:11,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:39:11,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-12-02 14:39:11,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:39:11,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:39:11,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:39:11,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:39:11,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:39:11,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:39:11,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:39:11,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:39:11,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:39:11,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:39:11,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:39:11,992 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:39:11,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:39:11,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:39:11,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:39:11,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:39:11,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:39:11,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:39:11,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:39:11,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:39:11,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:39:11,995 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1 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 -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2024-12-02 14:39:12,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:39:12,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:39:12,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:39:12,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:39:12,228 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:39:12,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-12-02 14:39:14,939 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/6792fb224/4babcd06dc1148878e16cf439cd894f3/FLAGcdb389a1a [2024-12-02 14:39:15,120 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:39:15,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2024-12-02 14:39:15,126 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/6792fb224/4babcd06dc1148878e16cf439cd894f3/FLAGcdb389a1a [2024-12-02 14:39:15,138 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/data/6792fb224/4babcd06dc1148878e16cf439cd894f3 [2024-12-02 14:39:15,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:39:15,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:39:15,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:39:15,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:39:15,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:39:15,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b166ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15, skipping insertion in model container [2024-12-02 14:39:15,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:39:15,290 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_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2024-12-02 14:39:15,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:39:15,371 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:39:15,378 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_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2024-12-02 14:39:15,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:39:15,463 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:39:15,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15 WrapperNode [2024-12-02 14:39:15,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:39:15,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:39:15,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:39:15,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:39:15,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,518 INFO L138 Inliner]: procedures = 36, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 751 [2024-12-02 14:39:15,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:39:15,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:39:15,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:39:15,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:39:15,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,550 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2024-12-02 14:39:15,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:39:15,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:39:15,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:39:15,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:39:15,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (1/1) ... [2024-12-02 14:39:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:39:15,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:15,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:39:15,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-12-02 14:39:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-12-02 14:39:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-12-02 14:39:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-12-02 14:39:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 14:39:15,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:39:15,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:39:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-12-02 14:39:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 14:39:15,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 14:39:15,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-12-02 14:39:15,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-12-02 14:39:15,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-12-02 14:39:15,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-12-02 14:39:15,820 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:39:15,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:39:17,106 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2024-12-02 14:39:17,107 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:39:17,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:39:17,119 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 14:39:17,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:17 BoogieIcfgContainer [2024-12-02 14:39:17,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:39:17,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:39:17,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:39:17,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:39:17,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:39:15" (1/3) ... [2024-12-02 14:39:17,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4bc5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:39:17, skipping insertion in model container [2024-12-02 14:39:17,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:15" (2/3) ... [2024-12-02 14:39:17,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4bc5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:39:17, skipping insertion in model container [2024-12-02 14:39:17,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:17" (3/3) ... [2024-12-02 14:39:17,128 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2024-12-02 14:39:17,141 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:39:17,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-86.i that has 2 procedures, 155 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 14:39:17,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:39:17,192 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;@31ad874f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:39:17,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:39:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 128 states have internal predecessors, (182), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-02 14:39:17,209 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:17,209 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:17,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 755641746, now seen corresponding path program 1 times [2024-12-02 14:39:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226184793] [2024-12-02 14:39:17,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:17,225 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-12-02 14:39:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:17,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:17,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:17,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 14:39:17,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-12-02 14:39:17,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:17,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:17,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226184793] [2024-12-02 14:39:17,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226184793] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:17,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:39:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052763017] [2024-12-02 14:39:17,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:17,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 14:39:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:17,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 14:39:17,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 14:39:17,755 INFO L87 Difference]: Start difference. First operand has 155 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 128 states have internal predecessors, (182), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:17,787 INFO L93 Difference]: Finished difference Result 303 states and 483 transitions. [2024-12-02 14:39:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 14:39:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-12-02 14:39:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:17,793 INFO L225 Difference]: With dead ends: 303 [2024-12-02 14:39:17,793 INFO L226 Difference]: Without dead ends: 151 [2024-12-02 14:39:17,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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-12-02 14:39:17,798 INFO L435 NwaCegarLoop]: 225 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, 225 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-12-02 14:39:17,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-12-02 14:39:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-12-02 14:39:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2024-12-02 14:39:17,840 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 184 [2024-12-02 14:39:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:17,841 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2024-12-02 14:39:17,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2024-12-02 14:39:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-02 14:39:17,845 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:17,846 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:17,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:18,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash -518523276, now seen corresponding path program 1 times [2024-12-02 14:39:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674442134] [2024-12-02 14:39:18,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:18,048 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-12-02 14:39:18,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:18,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:18,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:18,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:39:18,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-12-02 14:39:18,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:18,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:18,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674442134] [2024-12-02 14:39:18,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674442134] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:18,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:18,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:39:18,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052555961] [2024-12-02 14:39:18,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:18,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:39:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:18,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:39:18,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:39:18,591 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:18,652 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2024-12-02 14:39:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:39:18,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-12-02 14:39:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:18,655 INFO L225 Difference]: With dead ends: 301 [2024-12-02 14:39:18,655 INFO L226 Difference]: Without dead ends: 153 [2024-12-02 14:39:18,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 181 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-12-02 14:39:18,657 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 658 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-12-02 14:39:18,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 658 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-12-02 14:39:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-12-02 14:39:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-12-02 14:39:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2024-12-02 14:39:18,671 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 184 [2024-12-02 14:39:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:18,673 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2024-12-02 14:39:18,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2024-12-02 14:39:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-02 14:39:18,676 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:18,676 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:18,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-12-02 14:39:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:18,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash -588171150, now seen corresponding path program 1 times [2024-12-02 14:39:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208315559] [2024-12-02 14:39:18,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:18,878 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-12-02 14:39:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:18,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:18,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:19,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 14:39:19,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-12-02 14:39:19,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:20,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:20,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208315559] [2024-12-02 14:39:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208315559] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:20,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:39:20,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-12-02 14:39:20,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213885143] [2024-12-02 14:39:20,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:20,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:39:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:20,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:39:20,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:39:20,164 INFO L87 Difference]: Start difference. First operand 153 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:20,282 INFO L93 Difference]: Finished difference Result 386 states and 574 transitions. [2024-12-02 14:39:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:39:20,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-12-02 14:39:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:20,285 INFO L225 Difference]: With dead ends: 386 [2024-12-02 14:39:20,285 INFO L226 Difference]: Without dead ends: 236 [2024-12-02 14:39:20,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:39:20,287 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 118 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:20,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 872 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:39:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-12-02 14:39:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2024-12-02 14:39:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.4433497536945812) internal successors, (293), 204 states have internal predecessors, (293), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2024-12-02 14:39:20,306 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 184 [2024-12-02 14:39:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:20,307 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2024-12-02 14:39:20,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2024-12-02 14:39:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-02 14:39:20,310 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:20,310 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:20,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-12-02 14:39:20,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:20,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash 691692528, now seen corresponding path program 1 times [2024-12-02 14:39:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374719452] [2024-12-02 14:39:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:20,513 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-12-02 14:39:20,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:20,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:20,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:20,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:39:20,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:20,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:20,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374719452] [2024-12-02 14:39:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374719452] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67903491] [2024-12-02 14:39:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:39:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:20,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:39:20,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:39:20,969 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:21,025 INFO L93 Difference]: Finished difference Result 473 states and 705 transitions. [2024-12-02 14:39:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:39:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-12-02 14:39:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:21,029 INFO L225 Difference]: With dead ends: 473 [2024-12-02 14:39:21,029 INFO L226 Difference]: Without dead ends: 243 [2024-12-02 14:39:21,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:39:21,030 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:21,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 867 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-12-02 14:39:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2024-12-02 14:39:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.4265402843601895) internal successors, (301), 212 states have internal predecessors, (301), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 355 transitions. [2024-12-02 14:39:21,047 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 355 transitions. Word has length 184 [2024-12-02 14:39:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:21,048 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 355 transitions. [2024-12-02 14:39:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 355 transitions. [2024-12-02 14:39:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-02 14:39:21,050 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:21,051 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:21,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:21,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 693539570, now seen corresponding path program 1 times [2024-12-02 14:39:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487664680] [2024-12-02 14:39:21,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:21,252 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-12-02 14:39:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:21,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:21,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:21,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 14:39:21,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:21,788 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 77 treesize of output 41 [2024-12-02 14:39:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-12-02 14:39:21,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:21,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487664680] [2024-12-02 14:39:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487664680] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15381030] [2024-12-02 14:39:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:39:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:39:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:21,824 INFO L87 Difference]: Start difference. First operand 241 states and 355 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:22,639 INFO L93 Difference]: Finished difference Result 480 states and 708 transitions. [2024-12-02 14:39:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:39:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-12-02 14:39:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:22,645 INFO L225 Difference]: With dead ends: 480 [2024-12-02 14:39:22,645 INFO L226 Difference]: Without dead ends: 242 [2024-12-02 14:39:22,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:39:22,646 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 205 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:22,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 780 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 14:39:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-12-02 14:39:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2024-12-02 14:39:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.4218009478672986) internal successors, (300), 212 states have internal predecessors, (300), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 354 transitions. [2024-12-02 14:39:22,659 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 354 transitions. Word has length 184 [2024-12-02 14:39:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:22,659 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 354 transitions. [2024-12-02 14:39:22,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 354 transitions. [2024-12-02 14:39:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-02 14:39:22,661 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:22,662 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:22,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-12-02 14:39:22,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:22,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:22,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1044535562, now seen corresponding path program 1 times [2024-12-02 14:39:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:22,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898244175] [2024-12-02 14:39:22,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:22,863 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-12-02 14:39:22,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:22,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:22,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:23,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 14:39:23,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-12-02 14:39:23,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:23,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898244175] [2024-12-02 14:39:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898244175] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:39:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832435515] [2024-12-02 14:39:23,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:23,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:39:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:23,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:39:23,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:23,235 INFO L87 Difference]: Start difference. First operand 241 states and 354 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-12-02 14:39:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:23,434 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2024-12-02 14:39:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:39:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 186 [2024-12-02 14:39:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:23,437 INFO L225 Difference]: With dead ends: 485 [2024-12-02 14:39:23,437 INFO L226 Difference]: Without dead ends: 245 [2024-12-02 14:39:23,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:23,438 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:23,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 918 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-12-02 14:39:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2024-12-02 14:39:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.4170616113744077) internal successors, (299), 212 states have internal predecessors, (299), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 353 transitions. [2024-12-02 14:39:23,452 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 353 transitions. Word has length 186 [2024-12-02 14:39:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:23,452 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 353 transitions. [2024-12-02 14:39:23,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-12-02 14:39:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 353 transitions. [2024-12-02 14:39:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-02 14:39:23,454 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:23,454 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:23,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-12-02 14:39:23,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:23,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:23,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -433266504, now seen corresponding path program 1 times [2024-12-02 14:39:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:23,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246108970] [2024-12-02 14:39:23,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:23,655 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-12-02 14:39:23,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:23,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:23,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:24,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 14:39:24,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:24,155 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 95 treesize of output 41 [2024-12-02 14:39:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-12-02 14:39:24,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:24,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:24,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246108970] [2024-12-02 14:39:24,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246108970] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:24,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:24,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241917633] [2024-12-02 14:39:24,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:24,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:39:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:24,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:39:24,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:24,180 INFO L87 Difference]: Start difference. First operand 241 states and 353 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:25,213 INFO L93 Difference]: Finished difference Result 480 states and 704 transitions. [2024-12-02 14:39:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:39:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 186 [2024-12-02 14:39:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:25,221 INFO L225 Difference]: With dead ends: 480 [2024-12-02 14:39:25,221 INFO L226 Difference]: Without dead ends: 242 [2024-12-02 14:39:25,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:39:25,222 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 194 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:25,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 772 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 14:39:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-12-02 14:39:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2024-12-02 14:39:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.4123222748815165) internal successors, (298), 212 states have internal predecessors, (298), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 352 transitions. [2024-12-02 14:39:25,235 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 352 transitions. Word has length 186 [2024-12-02 14:39:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:25,235 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 352 transitions. [2024-12-02 14:39:25,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 352 transitions. [2024-12-02 14:39:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-02 14:39:25,237 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:25,237 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:25,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:25,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:25,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:25,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash -748812878, now seen corresponding path program 1 times [2024-12-02 14:39:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:25,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423179565] [2024-12-02 14:39:25,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:25,439 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-12-02 14:39:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:25,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:25,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:25,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 14:39:25,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:25,972 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 95 treesize of output 41 [2024-12-02 14:39:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-12-02 14:39:25,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:25,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:25,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423179565] [2024-12-02 14:39:25,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423179565] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:25,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:25,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264414329] [2024-12-02 14:39:25,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:39:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:26,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:39:26,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:26,000 INFO L87 Difference]: Start difference. First operand 241 states and 352 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:26,755 INFO L93 Difference]: Finished difference Result 479 states and 701 transitions. [2024-12-02 14:39:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:39:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 188 [2024-12-02 14:39:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:26,760 INFO L225 Difference]: With dead ends: 479 [2024-12-02 14:39:26,760 INFO L226 Difference]: Without dead ends: 241 [2024-12-02 14:39:26,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:39:26,761 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 187 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:26,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 767 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 14:39:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-12-02 14:39:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2024-12-02 14:39:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 210 states have internal predecessors, (295), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 349 transitions. [2024-12-02 14:39:26,772 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 349 transitions. Word has length 188 [2024-12-02 14:39:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:26,773 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 349 transitions. [2024-12-02 14:39:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 14:39:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 349 transitions. [2024-12-02 14:39:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-02 14:39:26,774 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:26,774 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:26,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:26,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:26,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:26,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1389726458, now seen corresponding path program 1 times [2024-12-02 14:39:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136595927] [2024-12-02 14:39:26,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:26,976 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-12-02 14:39:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:26,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:26,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:27,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 14:39:27,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:27,529 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 94 treesize of output 40 [2024-12-02 14:39:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 504 proven. 24 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-12-02 14:39:27,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:27,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-12-02 14:39:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-12-02 14:39:27,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136595927] [2024-12-02 14:39:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136595927] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:27,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:39:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-12-02 14:39:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399725866] [2024-12-02 14:39:27,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:27,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 14:39:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:27,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 14:39:27,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:39:27,831 INFO L87 Difference]: Start difference. First operand 239 states and 349 transitions. Second operand has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 12 states have internal predecessors, (104), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-12-02 14:39:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:29,074 INFO L93 Difference]: Finished difference Result 490 states and 712 transitions. [2024-12-02 14:39:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 14:39:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 12 states have internal predecessors, (104), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) Word has length 190 [2024-12-02 14:39:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:29,080 INFO L225 Difference]: With dead ends: 490 [2024-12-02 14:39:29,080 INFO L226 Difference]: Without dead ends: 243 [2024-12-02 14:39:29,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:39:29,082 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 188 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:29,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1148 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 14:39:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-12-02 14:39:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2024-12-02 14:39:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.4019138755980862) internal successors, (293), 210 states have internal predecessors, (293), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-12-02 14:39:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 347 transitions. [2024-12-02 14:39:29,089 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 347 transitions. Word has length 190 [2024-12-02 14:39:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:29,089 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 347 transitions. [2024-12-02 14:39:29,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 12 states have internal predecessors, (104), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-12-02 14:39:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 347 transitions. [2024-12-02 14:39:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-02 14:39:29,091 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:29,091 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:29,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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)] Ended with exit code 0 [2024-12-02 14:39:29,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:29,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:29,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1117371016, now seen corresponding path program 1 times [2024-12-02 14:39:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461242108] [2024-12-02 14:39:29,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:29,292 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-12-02 14:39:29,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:29,294 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:29,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:29,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 14:39:29,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:29,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-12-02 14:39:30,009 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 36 treesize of output 29 [2024-12-02 14:39:30,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:39:30,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 27 [2024-12-02 14:39:31,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:39:31,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 38 [2024-12-02 14:39:31,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:39:31,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 43 [2024-12-02 14:39:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 649 proven. 42 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-12-02 14:39:31,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-12-02 14:39:31,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 14:39:31,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461242108] [2024-12-02 14:39:31,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461242108] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:31,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:39:31,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2024-12-02 14:39:31,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428032904] [2024-12-02 14:39:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:31,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:39:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 14:39:31,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:39:31,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-12-02 14:39:31,676 INFO L87 Difference]: Start difference. First operand 239 states and 347 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:32,394 INFO L93 Difference]: Finished difference Result 552 states and 788 transitions. [2024-12-02 14:39:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:39:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2024-12-02 14:39:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:32,397 INFO L225 Difference]: With dead ends: 552 [2024-12-02 14:39:32,397 INFO L226 Difference]: Without dead ends: 316 [2024-12-02 14:39:32,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-12-02 14:39:32,399 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 312 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:32,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1153 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 14:39:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-12-02 14:39:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2024-12-02 14:39:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 264 states have (on average 1.3409090909090908) internal successors, (354), 266 states have internal predecessors, (354), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-12-02 14:39:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 440 transitions. [2024-12-02 14:39:32,421 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 440 transitions. Word has length 190 [2024-12-02 14:39:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:32,422 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 440 transitions. [2024-12-02 14:39:32,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-12-02 14:39:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 440 transitions. [2024-12-02 14:39:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-02 14:39:32,424 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:32,424 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 14:39:32,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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)] Ended with exit code 0 [2024-12-02 14:39:32,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:32,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:32,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 785686547, now seen corresponding path program 1 times [2024-12-02 14:39:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 14:39:32,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944453498] [2024-12-02 14:39:32,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:32,626 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-12-02 14:39:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 14:39:32,628 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 14:39:32,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a5160c2-d1f1-4eaf-858c-ef5599a9a90f/bin/uautomizer-verify-84ZbGMXZE1/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