./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU --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 e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:32,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:32,963 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:17:32,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:32,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:33,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:33,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:33,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:33,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:33,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:33,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:33,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:33,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:33,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:33,020 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:33,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:33,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:33,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:33,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:33,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:33,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:33,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:33,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:33,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:33,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:33,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:33,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:33,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:33,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:33,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:33,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:33,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:33,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:33,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:33,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:33,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:33,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:33,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:33,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:33,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:33,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:33,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:33,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d [2024-10-31 22:17:33,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:33,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:33,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:33,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:33,477 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:33,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i Unable to find full path for "g++" [2024-10-31 22:17:35,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:36,071 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:36,073 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2024-10-31 22:17:36,108 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data/7708c929a/2b203c6d094b43e78768fc89df52dac3/FLAG0acf6f40f [2024-10-31 22:17:36,127 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data/7708c929a/2b203c6d094b43e78768fc89df52dac3 [2024-10-31 22:17:36,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:36,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:36,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:36,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:36,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:36,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb4a5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36, skipping insertion in model container [2024-10-31 22:17:36,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:36,535 WARN L251 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_ef4be452-c112-4e32-86b5-1c666491939c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2024-10-31 22:17:36,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:36,644 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:36,660 WARN L251 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_ef4be452-c112-4e32-86b5-1c666491939c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2024-10-31 22:17:36,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:36,737 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:36,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36 WrapperNode [2024-10-31 22:17:36,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:36,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:36,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:36,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:36,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,825 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-10-31 22:17:36,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:36,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:36,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:36,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:36,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,875 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2024-10-31 22:17:36,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:36,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:36,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:36,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:36,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (1/1) ... [2024-10-31 22:17:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:36,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:36,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:36,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:17:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:17:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:17:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:17:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:17:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:17:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-31 22:17:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-31 22:17:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:17:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:17:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:17:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:17:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:17:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:17:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 22:17:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-31 22:17:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:17:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:17:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:17:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:17:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:17:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:17:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-31 22:17:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-31 22:17:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:17:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:17:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:17:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:17:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:17:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:17:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:17:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:17:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-31 22:17:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-31 22:17:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:37,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:17:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:17:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:17:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:17:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:17:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:17:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 22:17:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-31 22:17:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:37,354 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:37,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:38,073 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:38,073 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:38,105 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:38,106 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:38,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:38 BoogieIcfgContainer [2024-10-31 22:17:38,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:38,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:38,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:38,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:38,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:36" (1/3) ... [2024-10-31 22:17:38,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5312451d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:38, skipping insertion in model container [2024-10-31 22:17:38,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:36" (2/3) ... [2024-10-31 22:17:38,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5312451d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:38, skipping insertion in model container [2024-10-31 22:17:38,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:38" (3/3) ... [2024-10-31 22:17:38,120 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2024-10-31 22:17:38,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:38,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:38,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:38,241 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;@599f7578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:38,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:38,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:38,268 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:38,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1918999069, now seen corresponding path program 1 times [2024-10-31 22:17:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193538364] [2024-10-31 22:17:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:17:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193538364] [2024-10-31 22:17:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193538364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:39,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366711373] [2024-10-31 22:17:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:39,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:39,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:39,122 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:17:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:39,225 INFO L93 Difference]: Finished difference Result 215 states and 335 transitions. [2024-10-31 22:17:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-10-31 22:17:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:39,241 INFO L225 Difference]: With dead ends: 215 [2024-10-31 22:17:39,242 INFO L226 Difference]: Without dead ends: 107 [2024-10-31 22:17:39,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10-31 22:17:39,253 INFO L432 NwaCegarLoop]: 152 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, 152 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-10-31 22:17:39,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-31 22:17:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-31 22:17:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-31 22:17:39,339 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 152 [2024-10-31 22:17:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:39,340 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-31 22:17:39,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:17:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-31 22:17:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:39,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:39,347 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:39,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:39,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:39,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -396215223, now seen corresponding path program 1 times [2024-10-31 22:17:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726126571] [2024-10-31 22:17:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:17:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:39,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726126571] [2024-10-31 22:17:39,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726126571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897935337] [2024-10-31 22:17:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:39,889 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:17:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:39,955 INFO L93 Difference]: Finished difference Result 213 states and 304 transitions. [2024-10-31 22:17:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-10-31 22:17:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:39,962 INFO L225 Difference]: With dead ends: 213 [2024-10-31 22:17:39,962 INFO L226 Difference]: Without dead ends: 109 [2024-10-31 22:17:39,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-10-31 22:17:39,968 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 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-10-31 22:17:39,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-31 22:17:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-31 22:17:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-31 22:17:39,998 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 152 [2024-10-31 22:17:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-31 22:17:40,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:17:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-31 22:17:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:40,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:40,008 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:40,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:40,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1795168825, now seen corresponding path program 1 times [2024-10-31 22:17:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851773437] [2024-10-31 22:17:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:17:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:40,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851773437] [2024-10-31 22:17:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851773437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:40,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872804947] [2024-10-31 22:17:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:40,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:40,546 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:17:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:40,624 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2024-10-31 22:17:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-10-31 22:17:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:40,627 INFO L225 Difference]: With dead ends: 218 [2024-10-31 22:17:40,627 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:17:40,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-10-31 22:17:40,631 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:40,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:17:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-31 22:17:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-31 22:17:40,643 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 152 [2024-10-31 22:17:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:40,644 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-31 22:17:40,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:17:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-31 22:17:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:40,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:40,647 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:40,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:40,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:40,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1115110455, now seen corresponding path program 1 times [2024-10-31 22:17:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:40,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654726435] [2024-10-31 22:17:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:17:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654726435] [2024-10-31 22:17:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654726435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282509281] [2024-10-31 22:17:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:40,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:40,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:40,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:40,993 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:17:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:41,036 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2024-10-31 22:17:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-10-31 22:17:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:41,043 INFO L225 Difference]: With dead ends: 222 [2024-10-31 22:17:41,043 INFO L226 Difference]: Without dead ends: 114 [2024-10-31 22:17:41,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-10-31 22:17:41,048 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:41,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-31 22:17:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-31 22:17:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2024-10-31 22:17:41,067 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 152 [2024-10-31 22:17:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:41,068 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2024-10-31 22:17:41,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:17:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-10-31 22:17:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:41,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:41,074 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:41,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:41,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash 659896907, now seen corresponding path program 1 times [2024-10-31 22:17:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732182425] [2024-10-31 22:17:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:17:41,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732182425] [2024-10-31 22:17:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732182425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928531285] [2024-10-31 22:17:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:41,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:41,375 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:17:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:41,416 INFO L93 Difference]: Finished difference Result 226 states and 317 transitions. [2024-10-31 22:17:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-10-31 22:17:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:41,419 INFO L225 Difference]: With dead ends: 226 [2024-10-31 22:17:41,420 INFO L226 Difference]: Without dead ends: 116 [2024-10-31 22:17:41,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-10-31 22:17:41,422 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:41,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-31 22:17:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-31 22:17:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-10-31 22:17:41,435 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 152 [2024-10-31 22:17:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:41,437 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-10-31 22:17:41,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:17:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-10-31 22:17:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:41,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:41,440 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:41,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:41,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:41,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash 661743949, now seen corresponding path program 1 times [2024-10-31 22:17:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890445159] [2024-10-31 22:17:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:17:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:17:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 22:17:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:17:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890445159] [2024-10-31 22:17:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890445159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:45,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:45,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:17:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060889999] [2024-10-31 22:17:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:45,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:17:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:17:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:17:45,134 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-10-31 22:17:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:48,414 INFO L93 Difference]: Finished difference Result 536 states and 730 transitions. [2024-10-31 22:17:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-31 22:17:48,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 152 [2024-10-31 22:17:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:48,421 INFO L225 Difference]: With dead ends: 536 [2024-10-31 22:17:48,421 INFO L226 Difference]: Without dead ends: 424 [2024-10-31 22:17:48,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2024-10-31 22:17:48,425 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 800 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:48,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1375 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-31 22:17:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-31 22:17:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 249. [2024-10-31 22:17:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 205 states have (on average 1.2926829268292683) internal successors, (265), 207 states have internal predecessors, (265), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-31 22:17:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 339 transitions. [2024-10-31 22:17:48,498 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 339 transitions. Word has length 152 [2024-10-31 22:17:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:48,499 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 339 transitions. [2024-10-31 22:17:48,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-10-31 22:17:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2024-10-31 22:17:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-31 22:17:48,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:48,505 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:48,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:17:48,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:48,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1015378120, now seen corresponding path program 1 times [2024-10-31 22:17:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:48,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601049822] [2024-10-31 22:17:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:48,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:17:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:48,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:17:48,961 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:17:48,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:17:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:17:48,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:49,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:17:49,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:17:49 BoogieIcfgContainer [2024-10-31 22:17:49,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:17:49,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:17:49,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:17:49,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:17:49,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:38" (3/4) ... [2024-10-31 22:17:49,163 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:17:49,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:17:49,165 INFO L158 Benchmark]: Toolchain (without parser) took 13032.23ms. Allocated memory was 172.0MB in the beginning and 308.3MB in the end (delta: 136.3MB). Free memory was 143.8MB in the beginning and 205.3MB in the end (delta: -61.5MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-10-31 22:17:49,166 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 119.5MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:49,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.38ms. Allocated memory is still 172.0MB. Free memory was 143.6MB in the beginning and 129.9MB in the end (delta: 13.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-31 22:17:49,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.64ms. Allocated memory is still 172.0MB. Free memory was 129.9MB in the beginning and 125.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:17:49,167 INFO L158 Benchmark]: Boogie Preprocessor took 117.19ms. Allocated memory is still 172.0MB. Free memory was 125.7MB in the beginning and 120.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:17:49,167 INFO L158 Benchmark]: RCFGBuilder took 1161.40ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 106.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:17:49,168 INFO L158 Benchmark]: TraceAbstraction took 11047.88ms. Allocated memory was 172.0MB in the beginning and 308.3MB in the end (delta: 136.3MB). Free memory was 105.6MB in the beginning and 206.4MB in the end (delta: -100.8MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-10-31 22:17:49,169 INFO L158 Benchmark]: Witness Printer took 5.76ms. Allocated memory is still 308.3MB. Free memory was 206.4MB in the beginning and 205.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:49,171 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.36ms. Allocated memory is still 119.5MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.38ms. Allocated memory is still 172.0MB. Free memory was 143.6MB in the beginning and 129.9MB in the end (delta: 13.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.64ms. Allocated memory is still 172.0MB. Free memory was 129.9MB in the beginning and 125.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.19ms. Allocated memory is still 172.0MB. Free memory was 125.7MB in the beginning and 120.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1161.40ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 106.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11047.88ms. Allocated memory was 172.0MB in the beginning and 308.3MB in the end (delta: 136.3MB). Free memory was 105.6MB in the beginning and 206.4MB in the end (delta: -100.8MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Witness Printer took 5.76ms. Allocated memory is still 308.3MB. Free memory was 206.4MB in the beginning and 205.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someUnaryDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L43] double last_1_double_Array_0_1__1_ = 9.15; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] EXPR double_Array_0[1][1] [L106] last_1_double_Array_0_1__1_ = double_Array_0[1][1] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] double_Array_0[0][0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] double_Array_0[1][0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] double_Array_0[0][1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L98] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L99] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L101] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L102] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L117] RET updateVariables() [L118] CALL step() [L47] EXPR unsigned_long_int_Array_0[0] [L47] unsigned_long_int_Array_0[1] = unsigned_long_int_Array_0[0] [L48] EXPR double_Array_0[0][0] [L48] float_Array_0[0] = double_Array_0[0][0] [L49] EXPR signed_char_Array_0[0] [L49] signed_char_Array_0[4] = signed_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L51] EXPR signed_char_Array_0[4] [L51] signed char stepLocal_1 = signed_char_Array_0[4]; [L52] EXPR unsigned_short_int_Array_0[0] [L52] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L52] COND FALSE !((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= stepLocal_1) [L55] EXPR signed_char_Array_0[0] [L55] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) [L55] EXPR signed_char_Array_0[0] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] signed_char_Array_0[1] = ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))) [L57] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L57] COND TRUE BOOL_unsigned_char_Array_0[0] [L58] EXPR signed_char_Array_0[0] [L58] EXPR signed_char_Array_0[3] [L58] signed_long_int_Array_0[1] = (signed_char_Array_0[0] - signed_char_Array_0[3]) [L62] EXPR signed_long_int_Array_0[1] [L62] signed long int stepLocal_0 = signed_long_int_Array_0[1]; [L63] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L63] COND TRUE stepLocal_0 < unsigned_long_int_Array_0[1] [L64] double_Array_0[1][1] = -0.5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR unsigned_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[0] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) [L109] EXPR signed_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) [L109] EXPR double_Array_0[1][1] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109-L110] return ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 3278 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2354 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 850 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 924 mSDtfsCounter, 850 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 178 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 1863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:17:49,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU --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 e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:52,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:52,191 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:17:52,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:52,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:52,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:52,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:52,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:52,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:52,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:52,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:52,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:52,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:52,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:52,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:52,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:52,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:52,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:52,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:52,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:52,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:52,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:52,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:52,269 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:17:52,269 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:17:52,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:52,270 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:17:52,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:52,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:52,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:52,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:52,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:52,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:52,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:52,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:52,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:52,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:52,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:52,278 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:17:52,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:17:52,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:52,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:52,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:52,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:52,280 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:17:52,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d [2024-10-31 22:17:52,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:52,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:52,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:52,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:52,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:52,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i Unable to find full path for "g++" [2024-10-31 22:17:54,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:55,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:55,278 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2024-10-31 22:17:55,288 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data/fd9fb1ab7/77697358ae9e4a7eb7208f9f95fba48c/FLAG63d00ad3e [2024-10-31 22:17:55,304 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/data/fd9fb1ab7/77697358ae9e4a7eb7208f9f95fba48c [2024-10-31 22:17:55,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:55,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:55,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:55,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:55,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:55,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:55" (1/1) ... [2024-10-31 22:17:55,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623f31a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:55, skipping insertion in model container [2024-10-31 22:17:55,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:55" (1/1) ... [2024-10-31 22:17:55,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:55,677 WARN L251 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_ef4be452-c112-4e32-86b5-1c666491939c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2024-10-31 22:17:55,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:55,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:55,872 WARN L251 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_ef4be452-c112-4e32-86b5-1c666491939c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i[916,929] [2024-10-31 22:17:55,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:56,020 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:56,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56 WrapperNode [2024-10-31 22:17:56,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:56,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:56,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:56,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:56,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,160 INFO L138 Inliner]: procedures = 39, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-10-31 22:17:56,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:56,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:56,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:56,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:56,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,260 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2024-10-31 22:17:56,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:56,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:56,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:56,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:56,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (1/1) ... [2024-10-31 22:17:56,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:56,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:56,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 22:17:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 22:17:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-31 22:17:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-31 22:17:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-31 22:17:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-31 22:17:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-31 22:17:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-31 22:17:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 22:17:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 22:17:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-31 22:17:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-31 22:17:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-31 22:17:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-31 22:17:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-31 22:17:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-31 22:17:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:17:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:17:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 22:17:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 22:17:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-31 22:17:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-31 22:17:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-31 22:17:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-31 22:17:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-31 22:17:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-31 22:17:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-31 22:17:56,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-31 22:17:56,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-31 22:17:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-31 22:17:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-31 22:17:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-31 22:17:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:17:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:17:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 22:17:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 22:17:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-31 22:17:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-31 22:17:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-31 22:17:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-31 22:17:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 22:17:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 22:17:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-31 22:17:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-31 22:17:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-31 22:17:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-31 22:17:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-31 22:17:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-31 22:17:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:17:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:17:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-31 22:17:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-31 22:17:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-31 22:17:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-31 22:17:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-31 22:17:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-31 22:17:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 22:17:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 22:17:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-31 22:17:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-31 22:17:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-31 22:17:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-31 22:17:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-31 22:17:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-31 22:17:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-31 22:17:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-31 22:17:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-31 22:17:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-31 22:17:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-31 22:17:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-31 22:17:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-31 22:17:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-31 22:17:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-31 22:17:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-31 22:17:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:17:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:17:56,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:17:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:17:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-31 22:17:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-31 22:17:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-31 22:17:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-31 22:17:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-31 22:17:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-31 22:17:56,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:56,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:56,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:17:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:17:56,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 22:17:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 22:17:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-31 22:17:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-31 22:17:56,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-31 22:17:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-31 22:17:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-31 22:17:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-31 22:17:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-31 22:17:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-31 22:17:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-31 22:17:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-31 22:17:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-31 22:17:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-31 22:17:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 22:17:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 22:17:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 22:17:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-31 22:17:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-31 22:17:56,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-31 22:17:56,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-31 22:17:56,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-31 22:17:56,783 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:56,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:58,890 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:58,890 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:58,913 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:58,913 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:58,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:58 BoogieIcfgContainer [2024-10-31 22:17:58,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:58,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:58,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:58,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:58,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:55" (1/3) ... [2024-10-31 22:17:58,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e99d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:58, skipping insertion in model container [2024-10-31 22:17:58,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:56" (2/3) ... [2024-10-31 22:17:58,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e99d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:58, skipping insertion in model container [2024-10-31 22:17:58,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:58" (3/3) ... [2024-10-31 22:17:58,925 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2024-10-31 22:17:58,952 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:58,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:59,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:59,042 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;@b7c5da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:59,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:17:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:17:59,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:59,062 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:17:59,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1918999069, now seen corresponding path program 1 times [2024-10-31 22:17:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175066910] [2024-10-31 22:17:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:59,091 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-10-31 22:17:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:59,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:17:59,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:17:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:59,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:17:59,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-31 22:17:59,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:59,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:59,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175066910] [2024-10-31 22:17:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175066910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922986241] [2024-10-31 22:17:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:59,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:59,910 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:17:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:59,949 INFO L93 Difference]: Finished difference Result 215 states and 335 transitions. [2024-10-31 22:17:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-10-31 22:17:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:59,961 INFO L225 Difference]: With dead ends: 215 [2024-10-31 22:17:59,961 INFO L226 Difference]: Without dead ends: 107 [2024-10-31 22:17:59,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-10-31 22:17:59,969 INFO L432 NwaCegarLoop]: 152 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, 152 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-10-31 22:17:59,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:18:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-31 22:18:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-31 22:18:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:18:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-31 22:18:00,052 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 152 [2024-10-31 22:18:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:00,053 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-31 22:18:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:18:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-31 22:18:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:18:00,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:00,066 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:18:00,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:18:00,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:18:00,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash -396215223, now seen corresponding path program 1 times [2024-10-31 22:18:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:18:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154748801] [2024-10-31 22:18:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:00,283 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-10-31 22:18:00,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:18:00,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:18:00,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:18:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:01,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:18:01,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-31 22:18:01,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:18:01,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:18:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154748801] [2024-10-31 22:18:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154748801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:01,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:18:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099932639] [2024-10-31 22:18:01,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:18:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:18:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:18:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:01,168 INFO L87 Difference]: Start difference. First operand 107 states and 152 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:18:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:01,497 INFO L93 Difference]: Finished difference Result 213 states and 304 transitions. [2024-10-31 22:18:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:18:01,507 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-10-31 22:18:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:01,510 INFO L225 Difference]: With dead ends: 213 [2024-10-31 22:18:01,512 INFO L226 Difference]: Without dead ends: 109 [2024-10-31 22:18:01,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:01,518 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 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.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:01,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:18:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-31 22:18:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-31 22:18:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:18:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-31 22:18:01,538 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 152 [2024-10-31 22:18:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:01,540 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-31 22:18:01,544 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:18:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-31 22:18:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 22:18:01,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:01,547 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:18:01,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-31 22:18:01,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:18:01,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:01,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1795168825, now seen corresponding path program 1 times [2024-10-31 22:18:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:18:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378185089] [2024-10-31 22:18:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:01,756 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-10-31 22:18:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:18:01,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:18:01,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4be452-c112-4e32-86b5-1c666491939c/bin/uautomizer-verify-4GaUIPS5ZU/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