./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:33,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:33,556 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:14:33,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:33,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:33,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:33,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:33,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:33,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:33,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:33,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:33,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:33,623 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:33,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:33,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:33,626 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:33,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:33,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:33,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:33,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:33,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:33,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:33,630 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:33,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:33,631 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:33,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:33,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:33,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:33,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:33,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:33,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:33,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:33,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:33,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:33,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:33,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:33,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:33,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:33,638 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:33,638 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_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2023-11-06 21:14:33,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:33,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:33,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:33,986 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:33,987 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:33,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2023-11-06 21:14:37,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:37,395 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:37,396 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2023-11-06 21:14:37,405 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data/3a346cd77/a6f7b3fd437c472fa8574b6c611d1142/FLAGf14dfa336 [2023-11-06 21:14:37,420 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data/3a346cd77/a6f7b3fd437c472fa8574b6c611d1142 [2023-11-06 21:14:37,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:37,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:37,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:37,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:37,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:37,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e876aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37, skipping insertion in model container [2023-11-06 21:14:37,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,462 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:37,620 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i[916,929] [2023-11-06 21:14:37,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:37,699 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:37,723 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i[916,929] [2023-11-06 21:14:37,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:37,796 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:37,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37 WrapperNode [2023-11-06 21:14:37,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:37,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:37,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:37,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:37,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,875 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2023-11-06 21:14:37,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:37,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:37,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:37,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:37,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:37,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:37,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:37,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:37,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (1/1) ... [2023-11-06 21:14:37,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:37,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:37,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:38,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:38,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:38,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:14:38,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:38,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:14:38,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:38,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:14:38,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:14:38,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:14:38,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:38,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:38,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:38,154 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:38,156 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:38,812 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:38,829 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:38,830 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:38,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:38 BoogieIcfgContainer [2023-11-06 21:14:38,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:38,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:38,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:38,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:38,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:37" (1/3) ... [2023-11-06 21:14:38,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bef5ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:38, skipping insertion in model container [2023-11-06 21:14:38,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:37" (2/3) ... [2023-11-06 21:14:38,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bef5ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:38, skipping insertion in model container [2023-11-06 21:14:38,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:38" (3/3) ... [2023-11-06 21:14:38,846 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2023-11-06 21:14:38,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:38,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:38,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:38,935 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@137aa6c3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:38,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:38,940 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) [2023-11-06 21:14:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:14:38,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:38,958 INFO L195 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] [2023-11-06 21:14:38,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:38,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash 250668227, now seen corresponding path program 1 times [2023-11-06 21:14:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:38,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228645141] [2023-11-06 21:14:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228645141] [2023-11-06 21:14:39,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-06 21:14:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047637038] [2023-11-06 21:14:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:39,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:39,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:39,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:14:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:39,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:14:39,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-11-06 21:14:39,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047637038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083765507] [2023-11-06 21:14:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:39,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:39,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:39,842 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 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 21:14:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:39,904 INFO L93 Difference]: Finished difference Result 215 states and 335 transitions. [2023-11-06 21:14:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 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 153 [2023-11-06 21:14:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:39,918 INFO L225 Difference]: With dead ends: 215 [2023-11-06 21:14:39,918 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 21:14:39,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:39,930 INFO L413 NwaCegarLoop]: 154 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, 154 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 [2023-11-06 21:14:39,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 21:14:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-06 21:14:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 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) [2023-11-06 21:14:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2023-11-06 21:14:40,016 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2023-11-06 21:14:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:40,017 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2023-11-06 21:14:40,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 21:14:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2023-11-06 21:14:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:14:40,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:40,028 INFO L195 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] [2023-11-06 21:14:40,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 21:14:40,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:40,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2058345439, now seen corresponding path program 1 times [2023-11-06 21:14:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120096200] [2023-11-06 21:14:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:40,385 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064798170] [2023-11-06 21:14:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:40,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:40,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:14:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 21:14:40,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-06 21:14:40,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:40,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120096200] [2023-11-06 21:14:40,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:40,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064798170] [2023-11-06 21:14:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064798170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:40,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:40,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773165180] [2023-11-06 21:14:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:40,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:40,846 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-11-06 21:14:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:40,926 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2023-11-06 21:14:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 153 [2023-11-06 21:14:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:40,934 INFO L225 Difference]: With dead ends: 215 [2023-11-06 21:14:40,935 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 21:14:40,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:40,941 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 3 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 445 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 [2023-11-06 21:14:40,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 21:14:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2023-11-06 21:14:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 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) [2023-11-06 21:14:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2023-11-06 21:14:40,966 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2023-11-06 21:14:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:40,968 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2023-11-06 21:14:40,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-11-06 21:14:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2023-11-06 21:14:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:14:40,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:40,971 INFO L195 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] [2023-11-06 21:14:40,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:41,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-06 21:14:41,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:41,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2056498397, now seen corresponding path program 1 times [2023-11-06 21:14:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213811864] [2023-11-06 21:14:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:41,271 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354239172] [2023-11-06 21:14:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:41,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:41,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:41,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:14:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 21:14:41,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:42,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:14:42,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:42,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:14:43,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:14:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:43,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:14:43,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 21:14:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 99 proven. 195 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2023-11-06 21:14:43,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:43,249 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 Int) (v_ArrVal_366 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) (+ 5 |c_~#signed_char_Array_0~0.offset|) v_ArrVal_364)) |c_~#double_Array_0~0.base| v_ArrVal_366) |c_~#signed_char_Array_0~0.base|) (+ 2 |c_~#signed_char_Array_0~0.offset|)) 1))) is different from false [2023-11-06 21:14:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213811864] [2023-11-06 21:14:43,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354239172] [2023-11-06 21:14:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354239172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:14:43,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:14:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-11-06 21:14:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355363521] [2023-11-06 21:14:43,288 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:43,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:14:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:43,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:14:43,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2023-11-06 21:14:43,291 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 21:14:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:44,025 INFO L93 Difference]: Finished difference Result 225 states and 318 transitions. [2023-11-06 21:14:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:14:44,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2023-11-06 21:14:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:44,028 INFO L225 Difference]: With dead ends: 225 [2023-11-06 21:14:44,028 INFO L226 Difference]: Without dead ends: 119 [2023-11-06 21:14:44,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=218, Unknown=2, NotChecked=32, Total=342 [2023-11-06 21:14:44,030 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 93 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:44,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 475 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:14:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-06 21:14:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2023-11-06 21:14:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:14:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2023-11-06 21:14:44,047 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 153 [2023-11-06 21:14:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:44,048 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2023-11-06 21:14:44,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 21:14:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2023-11-06 21:14:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:14:44,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:44,051 INFO L195 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] [2023-11-06 21:14:44,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:44,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-06 21:14:44,259 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:44,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1633796571, now seen corresponding path program 1 times [2023-11-06 21:14:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543262017] [2023-11-06 21:14:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:44,350 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673256317] [2023-11-06 21:14:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:44,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:44,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:44,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:44,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:14:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:44,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:14:44,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:46,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-11-06 21:14:46,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:46,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:14:46,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:46,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:14:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:46,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:14:46,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:46,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:14:46,936 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 21:14:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-06 21:14:46,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543262017] [2023-11-06 21:14:46,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:14:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673256317] [2023-11-06 21:14:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673256317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:14:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46808566] [2023-11-06 21:14:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:14:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:46,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:14:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:14:46,962 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 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) [2023-11-06 21:14:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:47,690 INFO L93 Difference]: Finished difference Result 329 states and 464 transitions. [2023-11-06 21:14:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:14:47,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 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 153 [2023-11-06 21:14:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:47,694 INFO L225 Difference]: With dead ends: 329 [2023-11-06 21:14:47,694 INFO L226 Difference]: Without dead ends: 219 [2023-11-06 21:14:47,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:14:47,696 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 471 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:47,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 384 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:14:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-06 21:14:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 186. [2023-11-06 21:14:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 158 states have internal predecessors, (212), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:14:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2023-11-06 21:14:47,724 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 153 [2023-11-06 21:14:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:47,725 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2023-11-06 21:14:47,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 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) [2023-11-06 21:14:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2023-11-06 21:14:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:14:47,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:47,729 INFO L195 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] [2023-11-06 21:14:47,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:47,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:47,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:47,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash -353932893, now seen corresponding path program 1 times [2023-11-06 21:14:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:47,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500015205] [2023-11-06 21:14:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:48,011 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:14:48,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510678493] [2023-11-06 21:14:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:48,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:48,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:14:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:48,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-06 21:14:48,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:49,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:14:50,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:14:50,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-06 21:14:51,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-11-06 21:14:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:52,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 41 [2023-11-06 21:14:54,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 116 [2023-11-06 21:14:54,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 126 [2023-11-06 21:14:55,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:55,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 126 [2023-11-06 21:14:55,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 126 [2023-11-06 21:14:55,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:14:55,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 126 [2023-11-06 21:14:55,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 85 [2023-11-06 21:14:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 392 proven. 207 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-06 21:14:56,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:56,556 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse4 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse5 (+ |c_~#signed_char_Array_0~0.offset| 1))) (and (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (mod (+ (select .cse1 .cse3) (select .cse1 .cse4) (* 255 (select .cse1 .cse5))) 256))) (or (= .cse0 (+ 256 (select .cse1 .cse2))) (< .cse0 128))))) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (mod (+ (select .cse7 .cse3) (select .cse7 .cse4) (* 255 (select .cse7 .cse5))) 256))) (or (= .cse6 (select .cse7 .cse2)) (< 127 .cse6))))) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse8 (mod (+ (select .cse10 .cse3) (select .cse10 .cse4) (* 255 (select .cse10 .cse5))) 256)) (.cse9 (select .cse10 .cse2))) (or (= .cse8 (+ 256 .cse9)) (= .cse8 .cse9))))))) is different from false [2023-11-06 21:14:56,621 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse4 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse5 (+ |c_~#signed_char_Array_0~0.offset| 1))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse1 (select .cse2 .cse6)) (.cse0 (mod (+ (select .cse2 .cse3) (select .cse2 .cse4) (* 255 (select .cse2 .cse5))) 256))) (or (= .cse0 .cse1) (= (+ .cse1 256) .cse0))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse7 (mod (+ (select .cse8 .cse3) (select .cse8 .cse4) (* 255 (select .cse8 .cse5))) 256))) (or (< .cse7 128) (= (+ (select .cse8 .cse6) 256) .cse7))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (mod (+ (select .cse10 .cse3) (select .cse10 .cse4) (* 255 (select .cse10 .cse5))) 256))) (or (< 127 .cse9) (= .cse9 (select .cse10 .cse6)))))))) is different from false [2023-11-06 21:14:58,693 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ |c_~#signed_char_Array_0~0.offset| 1))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (select .cse2 .cse6)) (.cse1 (mod (+ (select .cse2 .cse3) (select .cse2 .cse4) (* (select .cse2 .cse5) 255)) 256))) (or (= (+ 256 .cse0) .cse1) (= .cse0 .cse1))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse7 (mod (+ (select .cse8 .cse3) (select .cse8 .cse4) (* (select .cse8 .cse5) 255)) 256))) (or (< 127 .cse7) (= (select .cse8 .cse6) .cse7))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (mod (+ (select .cse10 .cse3) (select .cse10 .cse4) (* (select .cse10 .cse5) 255)) 256))) (or (< .cse9 128) (= (+ 256 (select .cse10 .cse6)) .cse9))))))) is different from false [2023-11-06 21:15:00,878 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ |c_~#signed_char_Array_0~0.offset| 1)) (.cse2 (+ 5 |c_~#signed_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse1 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (mod (+ (select .cse1 .cse3) (select .cse1 .cse4) (* 255 (select .cse1 .cse5))) 256))) (or (< 127 .cse0) (= (select .cse1 .cse2) .cse0))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse7 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (mod (+ (select .cse7 .cse3) (select .cse7 .cse4) (* 255 (select .cse7 .cse5))) 256))) (or (< .cse6 128) (= (+ (select .cse7 .cse2) 256) .cse6))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse8 (select .cse10 .cse2)) (.cse9 (mod (+ (select .cse10 .cse3) (select .cse10 .cse4) (* 255 (select .cse10 .cse5))) 256))) (or (= (+ .cse8 256) .cse9) (= .cse8 .cse9))))))) is different from false [2023-11-06 21:15:01,159 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse6 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ |c_~#signed_char_Array_0~0.offset| 1)) (.cse13 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|)) (.cse3 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse0 (mod (+ |c_ULTIMATE.start_step_#t~mem5#1| (* |c_ULTIMATE.start_step_#t~ite12#1| 255) |c_ULTIMATE.start_step_#t~mem4#1|) 256))) (and (or (< 127 .cse0) (let ((.cse7 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse3 .cse0)))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse2 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse1 (mod (+ (select .cse2 .cse4) (* 255 (select .cse2 .cse5)) (select .cse2 .cse6)) 256))) (or (= .cse1 (select .cse2 .cse3)) (< 127 .cse1))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse10 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (select .cse10 .cse3)) (.cse8 (mod (+ (select .cse10 .cse4) (* 255 (select .cse10 .cse5)) (select .cse10 .cse6)) 256))) (or (= .cse8 .cse9) (= (+ 256 .cse9) .cse8))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse11 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse12 (mod (+ (select .cse11 .cse4) (* 255 (select .cse11 .cse5)) (select .cse11 .cse6)) 256))) (or (= (+ 256 (select .cse11 .cse3)) .cse12) (< .cse12 128)))))))) (or (< .cse0 128) (let ((.cse16 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse3 (+ .cse0 (- 256)))))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse15 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse14 (mod (+ (select .cse15 .cse4) (select .cse15 .cse6) (* (select .cse15 .cse5) 255)) 256))) (or (< .cse14 128) (= (+ 256 (select .cse15 .cse3)) .cse14))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse18 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse17 (mod (+ (select .cse18 .cse4) (select .cse18 .cse6) (* (select .cse18 .cse5) 255)) 256))) (or (= .cse17 (select .cse18 .cse3)) (< 127 .cse17))))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse21 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_622) |c_~#float_Array_0~0.base| v_ArrVal_623) |c_~#signed_char_Array_0~0.base|))) (let ((.cse20 (select .cse21 .cse3)) (.cse19 (mod (+ (select .cse21 .cse4) (select .cse21 .cse6) (* (select .cse21 .cse5) 255)) 256))) (or (= .cse19 .cse20) (= (+ 256 .cse20) .cse19)))))))))) is different from false [2023-11-06 21:15:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500015205] [2023-11-06 21:15:02,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:15:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510678493] [2023-11-06 21:15:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510678493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:02,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:15:02,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2023-11-06 21:15:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714099521] [2023-11-06 21:15:02,652 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:02,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-06 21:15:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 21:15:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1864, Unknown=5, NotChecked=470, Total=2652 [2023-11-06 21:15:02,656 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand has 42 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 11 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (19), 9 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-06 21:15:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:11,503 INFO L93 Difference]: Finished difference Result 498 states and 682 transitions. [2023-11-06 21:15:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-06 21:15:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 11 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (19), 9 states have call predecessors, (19), 11 states have call successors, (19) Word has length 153 [2023-11-06 21:15:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:11,508 INFO L225 Difference]: With dead ends: 498 [2023-11-06 21:15:11,509 INFO L226 Difference]: Without dead ends: 315 [2023-11-06 21:15:11,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=833, Invalid=4732, Unknown=5, NotChecked=750, Total=6320 [2023-11-06 21:15:11,513 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 753 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:11,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2141 Invalid, 3202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [169 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-11-06 21:15:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-06 21:15:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 162. [2023-11-06 21:15:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:15:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 208 transitions. [2023-11-06 21:15:11,536 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 208 transitions. Word has length 153 [2023-11-06 21:15:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:11,536 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 208 transitions. [2023-11-06 21:15:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 11 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (19), 9 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-06 21:15:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 208 transitions. [2023-11-06 21:15:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:15:11,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:11,539 INFO L195 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] [2023-11-06 21:15:11,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:11,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:11,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:11,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 289431463, now seen corresponding path program 1 times [2023-11-06 21:15:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978883098] [2023-11-06 21:15:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:11,814 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:15:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024608574] [2023-11-06 21:15:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:11,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:11,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 21:15:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:12,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-06 21:15:12,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:13,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-06 21:15:14,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-11-06 21:15:15,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-11-06 21:15:16,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2023-11-06 21:15:17,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:17,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2023-11-06 21:15:18,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 118 [2023-11-06 21:15:18,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 139 [2023-11-06 21:15:19,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:19,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 139 [2023-11-06 21:15:19,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 139 [2023-11-06 21:15:19,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:19,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 139 [2023-11-06 21:15:20,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 96 [2023-11-06 21:15:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 353 proven. 249 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-06 21:15:20,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:20,823 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ 2 |c_~#signed_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_756 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (mod (+ (* (select .cse1 .cse3) 255) (select .cse1 .cse4) (* 255 (select .cse1 |c_~#signed_char_Array_0~0.offset|)) (select .cse1 .cse5)) 256))) (or (< 127 .cse0) (= .cse0 (select .cse1 .cse2)))))) (forall ((v_ArrVal_756 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (mod (+ (* (select .cse8 .cse3) 255) (select .cse8 .cse4) (* 255 (select .cse8 |c_~#signed_char_Array_0~0.offset|)) (select .cse8 .cse5)) 256)) (.cse7 (select .cse8 .cse2))) (or (= .cse6 (+ .cse7 256)) (= .cse6 .cse7))))) (forall ((v_ArrVal_756 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (mod (+ (* (select .cse10 .cse3) 255) (select .cse10 .cse4) (* 255 (select .cse10 |c_~#signed_char_Array_0~0.offset|)) (select .cse10 .cse5)) 256))) (or (= .cse9 (+ (select .cse10 .cse2) 256)) (< .cse9 128))))))) is different from false [2023-11-06 21:15:20,887 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse5 (+ |c_~#signed_char_Array_0~0.offset| 4))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (mod (+ (* 255 (select .cse1 .cse3)) (select .cse1 .cse4) (* 255 (select .cse1 |c_~#signed_char_Array_0~0.offset|)) (select .cse1 .cse5)) 256))) (or (< 127 .cse0) (= .cse0 (select .cse1 .cse2)))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (mod (+ (* 255 (select .cse7 .cse3)) (select .cse7 .cse4) (* 255 (select .cse7 |c_~#signed_char_Array_0~0.offset|)) (select .cse7 .cse5)) 256))) (or (= .cse6 (+ 256 (select .cse7 .cse2))) (< .cse6 128))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse8 (mod (+ (* 255 (select .cse10 .cse3)) (select .cse10 .cse4) (* 255 (select .cse10 |c_~#signed_char_Array_0~0.offset|)) (select .cse10 .cse5)) 256)) (.cse9 (select .cse10 .cse2))) (or (= .cse8 (+ 256 .cse9)) (= .cse8 .cse9))))))) is different from false [2023-11-06 21:15:20,954 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ 2 |c_~#signed_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (mod (+ (* 255 (select .cse1 .cse3)) (select .cse1 .cse4) (select .cse1 .cse5) (* 255 (select .cse1 |c_~#signed_char_Array_0~0.offset|))) 256))) (or (< 127 .cse0) (= .cse0 (select .cse1 .cse2)))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (mod (+ (* 255 (select .cse8 .cse3)) (select .cse8 .cse4) (select .cse8 .cse5) (* 255 (select .cse8 |c_~#signed_char_Array_0~0.offset|))) 256)) (.cse7 (select .cse8 .cse2))) (or (= .cse6 (+ .cse7 256)) (= .cse6 .cse7))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (mod (+ (* 255 (select .cse10 .cse3)) (select .cse10 .cse4) (select .cse10 .cse5) (* 255 (select .cse10 |c_~#signed_char_Array_0~0.offset|))) 256))) (or (= .cse9 (+ (select .cse10 .cse2) 256)) (< .cse9 128))))))) is different from false [2023-11-06 21:15:23,132 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ 3 |c_~#signed_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse1 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (mod (+ (select .cse1 .cse3) (* (select .cse1 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse1 .cse4) (* 255 (select .cse1 .cse5))) 256))) (or (< 127 .cse0) (= .cse0 (select .cse1 .cse2)))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse8 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (mod (+ (select .cse8 .cse3) (* (select .cse8 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse8 .cse4) (* 255 (select .cse8 .cse5))) 256)) (.cse7 (select .cse8 .cse2))) (or (= .cse6 (+ 256 .cse7)) (= .cse6 .cse7))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (mod (+ (select .cse10 .cse3) (* (select .cse10 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse10 .cse4) (* 255 (select .cse10 .cse5))) 256))) (or (= .cse9 (+ 256 (select .cse10 .cse2))) (< .cse9 128))))))) is different from false [2023-11-06 21:15:23,450 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (.cse5 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse7 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse13 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|)) (.cse4 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse0 (mod (+ |c_ULTIMATE.start_step_#t~mem5#1| (* |c_ULTIMATE.start_step_#t~ite12#1| 255) |c_ULTIMATE.start_step_#t~mem4#1|) 256))) (and (or (< .cse0 128) (let ((.cse8 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse4 (+ .cse0 (- 256)))))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse3 (select (store (store (store (store .cse8 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse2 (mod (+ (select .cse3 .cse5) (* 255 (select .cse3 .cse6)) (* 255 (select .cse3 |c_~#signed_char_Array_0~0.offset|)) (select .cse3 .cse7)) 256)) (.cse1 (select .cse3 .cse4))) (or (= (+ 256 .cse1) .cse2) (= .cse2 .cse1))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse10 (select (store (store (store (store .cse8 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (mod (+ (select .cse10 .cse5) (* 255 (select .cse10 .cse6)) (* 255 (select .cse10 |c_~#signed_char_Array_0~0.offset|)) (select .cse10 .cse7)) 256))) (or (< .cse9 128) (= (+ 256 (select .cse10 .cse4)) .cse9))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse12 (select (store (store (store (store .cse8 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse11 (mod (+ (select .cse12 .cse5) (* 255 (select .cse12 .cse6)) (* 255 (select .cse12 |c_~#signed_char_Array_0~0.offset|)) (select .cse12 .cse7)) 256))) (or (< 127 .cse11) (= .cse11 (select .cse12 .cse4))))))))) (or (< 127 .cse0) (let ((.cse16 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse4 .cse0)))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse15 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse14 (mod (+ (* 255 (select .cse15 .cse6)) (select .cse15 .cse5) (* (select .cse15 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse15 .cse7)) 256))) (or (< 127 .cse14) (= .cse14 (select .cse15 .cse4)))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse18 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse17 (mod (+ (* 255 (select .cse18 .cse6)) (select .cse18 .cse5) (* (select .cse18 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse18 .cse7)) 256))) (or (< .cse17 128) (= (+ 256 (select .cse18 .cse4)) .cse17))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse21 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse20 (select .cse21 .cse4)) (.cse19 (mod (+ (* 255 (select .cse21 .cse6)) (select .cse21 .cse5) (* (select .cse21 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse21 .cse7)) 256))) (or (= .cse19 .cse20) (= (+ 256 .cse20) .cse19)))))))))) is different from false [2023-11-06 21:15:24,009 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (.cse13 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse5 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse3 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse0 (mod (+ (* 255 (select .cse13 .cse4)) (* (select .cse13 |c_~#signed_char_Array_0~0.offset|) 255) |c_ULTIMATE.start_step_#t~mem5#1| |c_ULTIMATE.start_step_#t~mem4#1|) 256))) (and (or (< 127 .cse0) (let ((.cse7 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse3 .cse0)))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse2 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse1 (mod (+ (* 255 (select .cse2 |c_~#signed_char_Array_0~0.offset|)) (* 255 (select .cse2 .cse4)) (select .cse2 .cse5) (select .cse2 .cse6)) 256))) (or (= .cse1 (select .cse2 .cse3)) (< 127 .cse1))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse10 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (select .cse10 .cse3)) (.cse8 (mod (+ (* 255 (select .cse10 |c_~#signed_char_Array_0~0.offset|)) (* 255 (select .cse10 .cse4)) (select .cse10 .cse5) (select .cse10 .cse6)) 256))) (or (= .cse8 .cse9) (= (+ 256 .cse9) .cse8))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse11 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse12 (mod (+ (* 255 (select .cse11 |c_~#signed_char_Array_0~0.offset|)) (* 255 (select .cse11 .cse4)) (select .cse11 .cse5) (select .cse11 .cse6)) 256))) (or (= (+ 256 (select .cse11 .cse3)) .cse12) (< .cse12 128)))))))) (or (< .cse0 128) (let ((.cse16 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse3 (+ (- 256) .cse0))))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse14 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse15 (mod (+ (* 255 (select .cse14 |c_~#signed_char_Array_0~0.offset|)) (* 255 (select .cse14 .cse4)) (select .cse14 .cse6) (select .cse14 .cse5)) 256))) (or (= (+ 256 (select .cse14 .cse3)) .cse15) (< .cse15 128))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse19 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse18 (mod (+ (* 255 (select .cse19 |c_~#signed_char_Array_0~0.offset|)) (* 255 (select .cse19 .cse4)) (select .cse19 .cse6) (select .cse19 .cse5)) 256)) (.cse17 (select .cse19 .cse3))) (or (= (+ 256 .cse17) .cse18) (= .cse18 .cse17))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse21 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse20 (mod (+ (* 255 (select .cse21 |c_~#signed_char_Array_0~0.offset|)) (* 255 (select .cse21 .cse4)) (select .cse21 .cse6) (select .cse21 .cse5)) 256))) (or (< 127 .cse20) (= .cse20 (select .cse21 .cse3)))))))))))) is different from false [2023-11-06 21:15:24,209 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (.cse4 (+ |c_~#signed_char_Array_0~0.offset| 4)) (.cse13 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|)) (.cse6 (+ 2 |c_~#signed_char_Array_0~0.offset|))) (let ((.cse3 (+ 5 |c_~#signed_char_Array_0~0.offset|)) (.cse0 (mod (+ (* 255 (select .cse13 .cse5)) (select .cse13 .cse4) (* (select .cse13 |c_~#signed_char_Array_0~0.offset|) 255) (select .cse13 .cse6)) 256))) (and (or (< 127 .cse0) (let ((.cse7 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse3 .cse0)))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse2 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse1 (mod (+ (* 255 (select .cse2 |c_~#signed_char_Array_0~0.offset|)) (select .cse2 .cse4) (* 255 (select .cse2 .cse5)) (select .cse2 .cse6)) 256))) (or (< .cse1 128) (= (+ 256 (select .cse2 .cse3)) .cse1))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse10 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse9 (select .cse10 .cse3)) (.cse8 (mod (+ (* 255 (select .cse10 |c_~#signed_char_Array_0~0.offset|)) (select .cse10 .cse4) (* 255 (select .cse10 .cse5)) (select .cse10 .cse6)) 256))) (or (= .cse8 .cse9) (= (+ 256 .cse9) .cse8))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse12 (select (store (store (store (store .cse7 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse11 (mod (+ (* 255 (select .cse12 |c_~#signed_char_Array_0~0.offset|)) (select .cse12 .cse4) (* 255 (select .cse12 .cse5)) (select .cse12 .cse6)) 256))) (or (= .cse11 (select .cse12 .cse3)) (< 127 .cse11)))))))) (or (let ((.cse16 (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse13 .cse3 (+ (- 256) .cse0))))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse15 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse14 (mod (+ (* 255 (select .cse15 |c_~#signed_char_Array_0~0.offset|)) (select .cse15 .cse4) (select .cse15 .cse6) (* 255 (select .cse15 .cse5))) 256))) (or (< .cse14 128) (= .cse14 (+ 256 (select .cse15 .cse3))))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse19 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse17 (mod (+ (* 255 (select .cse19 |c_~#signed_char_Array_0~0.offset|)) (select .cse19 .cse4) (select .cse19 .cse6) (* 255 (select .cse19 .cse5))) 256)) (.cse18 (select .cse19 .cse3))) (or (= .cse17 (+ 256 .cse18)) (= .cse17 .cse18))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (let ((.cse21 (select (store (store (store (store .cse16 |c_~#double_Array_0~0.base| v_ArrVal_753) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_754) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_755) |c_~#float_Array_0~0.base| v_ArrVal_756) |c_~#signed_char_Array_0~0.base|))) (let ((.cse20 (mod (+ (* 255 (select .cse21 |c_~#signed_char_Array_0~0.offset|)) (select .cse21 .cse4) (select .cse21 .cse6) (* 255 (select .cse21 .cse5))) 256))) (or (= .cse20 (select .cse21 .cse3)) (< 127 .cse20))))))) (< .cse0 128))))) is different from false [2023-11-06 21:15:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978883098] [2023-11-06 21:15:24,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:15:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024608574] [2023-11-06 21:15:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024608574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:24,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:15:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2023-11-06 21:15:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249211944] [2023-11-06 21:15:24,482 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:24,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 21:15:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 21:15:24,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1568, Unknown=7, NotChecked=616, Total=2450 [2023-11-06 21:15:24,486 INFO L87 Difference]: Start difference. First operand 162 states and 208 transitions. Second operand has 40 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 11 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-06 21:15:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:32,250 INFO L93 Difference]: Finished difference Result 424 states and 551 transitions. [2023-11-06 21:15:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-11-06 21:15:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 11 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) Word has length 153 [2023-11-06 21:15:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:32,255 INFO L225 Difference]: With dead ends: 424 [2023-11-06 21:15:32,256 INFO L226 Difference]: Without dead ends: 265 [2023-11-06 21:15:32,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=813, Invalid=4464, Unknown=7, NotChecked=1036, Total=6320 [2023-11-06 21:15:32,260 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 613 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:32,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1638 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-06 21:15:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-06 21:15:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 170. [2023-11-06 21:15:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 139 states have (on average 1.2661870503597121) internal successors, (176), 139 states have internal predecessors, (176), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:15:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2023-11-06 21:15:32,286 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 153 [2023-11-06 21:15:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:32,286 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2023-11-06 21:15:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 11 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-06 21:15:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2023-11-06 21:15:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 21:15:32,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:32,290 INFO L195 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] [2023-11-06 21:15:32,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:32,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:32,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:32,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1569295141, now seen corresponding path program 1 times [2023-11-06 21:15:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:32,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512432190] [2023-11-06 21:15:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:32,537 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:15:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41462545] [2023-11-06 21:15:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:32,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:32,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:32,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 21:15:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:32,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:15:32,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:34,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-06 21:15:34,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:34,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:34,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:34,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:34,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:34,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:35,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:35,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:35,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 21:15:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-06 21:15:35,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:15:35,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512432190] [2023-11-06 21:15:35,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:15:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41462545] [2023-11-06 21:15:35,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41462545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:35,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:35,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:15:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831119004] [2023-11-06 21:15:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:35,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:15:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:15:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:15:35,092 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 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) [2023-11-06 21:15:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:36,122 INFO L93 Difference]: Finished difference Result 430 states and 555 transitions. [2023-11-06 21:15:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:15:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 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 153 [2023-11-06 21:15:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:36,125 INFO L225 Difference]: With dead ends: 430 [2023-11-06 21:15:36,125 INFO L226 Difference]: Without dead ends: 263 [2023-11-06 21:15:36,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:15:36,127 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 342 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:36,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 495 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:15:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-06 21:15:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 172. [2023-11-06 21:15:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:15:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2023-11-06 21:15:36,155 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 153 [2023-11-06 21:15:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:36,156 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2023-11-06 21:15:36,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 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) [2023-11-06 21:15:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2023-11-06 21:15:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-06 21:15:36,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:36,159 INFO L195 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, 1] [2023-11-06 21:15:36,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:36,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:36,374 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:36,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash 427647392, now seen corresponding path program 1 times [2023-11-06 21:15:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:36,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807603325] [2023-11-06 21:15:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:36,448 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:15:36,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794641869] [2023-11-06 21:15:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:36,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:36,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:36,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:36,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 21:15:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:36,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:15:36,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:39,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-11-06 21:15:39,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:39,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:15:39,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:39,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:15:39,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:39,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:15:39,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:39,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:15:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:39,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-11-06 21:15:39,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 21:15:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-06 21:15:39,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:15:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807603325] [2023-11-06 21:15:39,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:15:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794641869] [2023-11-06 21:15:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794641869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:39,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:15:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687609562] [2023-11-06 21:15:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:39,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:15:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:15:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:15:39,619 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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) [2023-11-06 21:15:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:40,528 INFO L93 Difference]: Finished difference Result 428 states and 551 transitions. [2023-11-06 21:15:40,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:15:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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 155 [2023-11-06 21:15:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:40,530 INFO L225 Difference]: With dead ends: 428 [2023-11-06 21:15:40,531 INFO L226 Difference]: Without dead ends: 259 [2023-11-06 21:15:40,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:15:40,532 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 358 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:40,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 466 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:15:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-06 21:15:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2023-11-06 21:15:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 139 states have internal predecessors, (175), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:15:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2023-11-06 21:15:40,560 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 155 [2023-11-06 21:15:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:40,560 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2023-11-06 21:15:40,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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) [2023-11-06 21:15:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2023-11-06 21:15:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-06 21:15:40,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:40,562 INFO L195 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, 1] [2023-11-06 21:15:40,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-06 21:15:40,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:40,769 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:40,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1201252832, now seen corresponding path program 1 times [2023-11-06 21:15:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557166857] [2023-11-06 21:15:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:40,832 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:15:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436307992] [2023-11-06 21:15:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:40,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:40,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:40,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 21:15:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:41,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:15:41,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:43,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-06 21:15:43,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:43,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:43,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:43,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:43,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:43,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:43,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:43,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:43,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:43,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-11-06 21:15:43,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 21:15:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-06 21:15:43,977 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:15:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557166857] [2023-11-06 21:15:43,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:15:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436307992] [2023-11-06 21:15:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436307992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:43,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:43,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:15:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188972011] [2023-11-06 21:15:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:15:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:15:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:15:43,980 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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) [2023-11-06 21:15:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:44,833 INFO L93 Difference]: Finished difference Result 396 states and 504 transitions. [2023-11-06 21:15:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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 155 [2023-11-06 21:15:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:44,835 INFO L225 Difference]: With dead ends: 396 [2023-11-06 21:15:44,836 INFO L226 Difference]: Without dead ends: 229 [2023-11-06 21:15:44,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:15:44,837 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 300 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:44,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 413 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:15:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-06 21:15:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2023-11-06 21:15:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 135 states have internal predecessors, (169), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:15:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2023-11-06 21:15:44,863 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 155 [2023-11-06 21:15:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:44,864 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2023-11-06 21:15:44,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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) [2023-11-06 21:15:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2023-11-06 21:15:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 21:15:44,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:44,866 INFO L195 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, 1, 1, 1] [2023-11-06 21:15:44,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:45,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:45,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:45,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1083824539, now seen corresponding path program 1 times [2023-11-06 21:15:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:45,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535961742] [2023-11-06 21:15:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:45,139 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:15:45,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724357243] [2023-11-06 21:15:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:45,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:45,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:45,141 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:45,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 21:15:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:45,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 21:15:45,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:46,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:15:47,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:47,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:47,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:48,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:48,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 21:15:48,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:48,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:48,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:48,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:48,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:49,005 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:49,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:49,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:49,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-11-06 21:15:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 284 proven. 237 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-11-06 21:15:49,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:49,348 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1284) |c_~#float_Array_0~0.base| v_ArrVal_1285) |c_~#signed_char_Array_0~0.base|))) (< (select .cse0 (+ |c_~#signed_char_Array_0~0.offset| 1)) (+ (select .cse0 |c_~#signed_char_Array_0~0.offset|) (select .cse0 (+ 3 |c_~#signed_char_Array_0~0.offset|)) 1)))) is different from false [2023-11-06 21:15:49,358 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1283) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1284) |c_~#float_Array_0~0.base| v_ArrVal_1285) |c_~#signed_char_Array_0~0.base|))) (< (select .cse0 (+ |c_~#signed_char_Array_0~0.offset| 1)) (+ (select .cse0 |c_~#signed_char_Array_0~0.offset|) (select .cse0 (+ 3 |c_~#signed_char_Array_0~0.offset|)) 1)))) is different from false [2023-11-06 21:15:49,489 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#signed_char_Array_0~0.offset| 1))) (or (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (let ((.cse0 (select (store (store (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1282) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1283) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1284) |c_~#float_Array_0~0.base| v_ArrVal_1285) |c_~#signed_char_Array_0~0.base|))) (< (select .cse0 .cse1) (+ (select .cse0 (+ 3 |c_~#signed_char_Array_0~0.offset|)) (select .cse0 |c_~#signed_char_Array_0~0.offset|) 1)))) (forall ((|ULTIMATE.start_step_#t~mem13#1| Int)) (< 0 (+ |c_ULTIMATE.start_step_#t~nondet16#1| (* |c_ULTIMATE.start_step_#t~nondet16#1| |ULTIMATE.start_step_#t~mem13#1|) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) .cse1)))))) is different from false [2023-11-06 21:15:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535961742] [2023-11-06 21:15:49,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:15:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724357243] [2023-11-06 21:15:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724357243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:49,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:15:49,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-11-06 21:15:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190178861] [2023-11-06 21:15:49,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:49,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:15:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:15:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=506, Unknown=11, NotChecked=144, Total=756 [2023-11-06 21:15:49,897 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-06 21:15:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:52,498 INFO L93 Difference]: Finished difference Result 424 states and 539 transitions. [2023-11-06 21:15:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 21:15:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) Word has length 157 [2023-11-06 21:15:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:52,501 INFO L225 Difference]: With dead ends: 424 [2023-11-06 21:15:52,501 INFO L226 Difference]: Without dead ends: 249 [2023-11-06 21:15:52,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=276, Invalid=1207, Unknown=11, NotChecked=228, Total=1722 [2023-11-06 21:15:52,503 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 441 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:52,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 953 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 21:15:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-06 21:15:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 168. [2023-11-06 21:15:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 137 states have internal predecessors, (171), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:15:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2023-11-06 21:15:52,531 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 157 [2023-11-06 21:15:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:52,532 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2023-11-06 21:15:52,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-06 21:15:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2023-11-06 21:15:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 21:15:52,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:52,534 INFO L195 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, 1, 1, 1] [2023-11-06 21:15:52,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:52,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 21:15:52,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:52,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1287914723, now seen corresponding path program 1 times [2023-11-06 21:15:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204174829] [2023-11-06 21:15:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:52,781 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:15:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259435307] [2023-11-06 21:15:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:52,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:52,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:52,782 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:52,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 21:15:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:53,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 21:15:53,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:54,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:15:54,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:55,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:55,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 21:15:55,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:55,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 21:15:56,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2023-11-06 21:15:56,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:56,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-11-06 21:15:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:56,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-11-06 21:15:56,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:56,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-11-06 21:15:56,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:56,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-11-06 21:15:57,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 21:15:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 284 proven. 237 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-11-06 21:15:57,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204174829] [2023-11-06 21:16:06,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:16:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259435307] [2023-11-06 21:16:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259435307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:06,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:16:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-11-06 21:16:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043529781] [2023-11-06 21:16:06,757 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:06,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:16:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:06,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:16:06,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=681, Unknown=14, NotChecked=0, Total=812 [2023-11-06 21:16:06,759 INFO L87 Difference]: Start difference. First operand 168 states and 209 transitions. Second operand has 20 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-06 21:16:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:16:09,663 INFO L93 Difference]: Finished difference Result 424 states and 539 transitions. [2023-11-06 21:16:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 21:16:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) Word has length 157 [2023-11-06 21:16:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:16:09,666 INFO L225 Difference]: With dead ends: 424 [2023-11-06 21:16:09,666 INFO L226 Difference]: Without dead ends: 259 [2023-11-06 21:16:09,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=344, Invalid=1534, Unknown=14, NotChecked=0, Total=1892 [2023-11-06 21:16:09,668 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 591 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:16:09,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 786 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 21:16:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-06 21:16:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 173. [2023-11-06 21:16:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 142 states have internal predecessors, (177), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:16:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 215 transitions. [2023-11-06 21:16:09,712 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 215 transitions. Word has length 157 [2023-11-06 21:16:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:16:09,712 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 215 transitions. [2023-11-06 21:16:09,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-06 21:16:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2023-11-06 21:16:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 21:16:09,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:16:09,714 INFO L195 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, 1, 1, 1] [2023-11-06 21:16:09,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:09,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 21:16:09,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:16:09,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1995935323, now seen corresponding path program 1 times [2023-11-06 21:16:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:09,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972379568] [2023-11-06 21:16:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:09,990 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:16:09,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314920888] [2023-11-06 21:16:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:09,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:09,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:09,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:10,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 21:16:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:10,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 21:16:10,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:11,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 21:16:11,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 21:16:11,401 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 21:16:11,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 21:16:11,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:11,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 21:16:12,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:12,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-11-06 21:16:12,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:12,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:12,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:12,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-06 21:16:12,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:12,437 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-11-06 21:16:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 354 proven. 33 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2023-11-06 21:16:12,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:12,822 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#unsigned_short_int_Array_0~0.offset| 2))) (and (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse0 (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse1 (mod (select (select .cse2 |c_~#unsigned_short_int_Array_0~0.base|) .cse3) 65536))) (or (< 0 (+ 102 (div .cse0 .cse1))) (< 0 (+ .cse0 1)) (= (mod .cse0 .cse1) 0))))) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse4 (select (select .cse6 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse5 (mod (select (select .cse6 |c_~#unsigned_short_int_Array_0~0.base|) .cse3) 65536))) (or (not (= (mod .cse4 .cse5) 0)) (< 0 (+ 101 (div .cse4 .cse5))))))) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse7 (select (select .cse8 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (or (< .cse7 0) (< 0 (+ 101 (div .cse7 (mod (select (select .cse8 |c_~#unsigned_short_int_Array_0~0.base|) .cse3) 65536)))))))))) is different from false [2023-11-06 21:16:13,127 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#unsigned_short_int_Array_0~0.offset| 2))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse0 (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (or (< .cse0 0) (< 0 (+ 101 (div .cse0 (mod (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536)))))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse3 (select (select .cse5 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse4 (mod (select (select .cse5 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536))) (or (< 0 (+ .cse3 1)) (= (mod .cse3 .cse4) 0) (< 0 (+ (div .cse3 .cse4) 102)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse6 (select (select .cse8 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse7 (mod (select (select .cse8 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536))) (or (not (= (mod .cse6 .cse7) 0)) (< 0 (+ 101 (div .cse6 .cse7))))))))) is different from false [2023-11-06 21:16:15,532 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#unsigned_short_int_Array_0~0.offset| 2)) (.cse3 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|)) (.cse4 (+ 5 |c_~#signed_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1548 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse3 .cse4 v_ArrVal_1548)) |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse0 (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (or (< .cse0 0) (< 0 (+ 101 (div .cse0 (mod (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536)))))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1548 Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse3 .cse4 v_ArrVal_1548)) |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse5 (select (select .cse7 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse6 (mod (select (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536))) (or (< 0 (+ 101 (div .cse5 .cse6))) (not (= (mod .cse5 .cse6) 0)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1548 Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse3 .cse4 v_ArrVal_1548)) |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse9 (mod (select (select .cse10 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536)) (.cse8 (select (select .cse10 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (or (< 0 (+ 102 (div .cse8 .cse9))) (= (mod .cse8 .cse9) 0) (< 0 (+ .cse8 1)))))))) is different from false [2023-11-06 21:16:16,233 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ |c_~#unsigned_short_int_Array_0~0.offset| 2)) (.cse3 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|)) (.cse4 (+ 5 |c_~#signed_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1548 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse3 .cse4 v_ArrVal_1548)) |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse0 (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (or (< .cse0 0) (< 0 (+ 101 (div .cse0 (mod (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536)))))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1548 Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse3 .cse4 v_ArrVal_1548)) |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse5 (select (select .cse7 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse6 (mod (select (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536))) (or (< 0 (+ 101 (div .cse5 .cse6))) (not (= (mod .cse5 .cse6) 0)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1548 Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store .cse3 .cse4 v_ArrVal_1548)) |c_~#double_Array_0~0.base| v_ArrVal_1549) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1550))) (let ((.cse9 (mod (select (select .cse10 |c_~#unsigned_short_int_Array_0~0.base|) .cse2) 65536)) (.cse8 (select (select .cse10 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (or (< 0 (+ 102 (div .cse8 .cse9))) (= (mod .cse8 .cse9) 0) (< 0 (+ .cse8 1)))))))) (= (mod |c_ULTIMATE.start_updateVariables_#t~mem76#1| 65536) 0)) is different from false [2023-11-06 21:16:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972379568] [2023-11-06 21:16:16,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:16:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314920888] [2023-11-06 21:16:16,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314920888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:16,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:16:16,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-11-06 21:16:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725589800] [2023-11-06 21:16:16,262 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:16,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:16:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:16,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:16:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=145, Unknown=4, NotChecked=108, Total=306 [2023-11-06 21:16:16,263 INFO L87 Difference]: Start difference. First operand 173 states and 215 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 21:16:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:16:18,719 INFO L93 Difference]: Finished difference Result 349 states and 433 transitions. [2023-11-06 21:16:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 21:16:18,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2023-11-06 21:16:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:16:18,722 INFO L225 Difference]: With dead ends: 349 [2023-11-06 21:16:18,722 INFO L226 Difference]: Without dead ends: 179 [2023-11-06 21:16:18,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=97, Invalid=335, Unknown=4, NotChecked=164, Total=600 [2023-11-06 21:16:18,724 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 114 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:16:18,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 456 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 21:16:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-06 21:16:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2023-11-06 21:16:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.232394366197183) internal successors, (175), 142 states have internal predecessors, (175), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-06 21:16:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2023-11-06 21:16:18,749 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 157 [2023-11-06 21:16:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:16:18,749 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2023-11-06 21:16:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 21:16:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2023-11-06 21:16:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 21:16:18,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:16:18,751 INFO L195 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, 1, 1, 1, 1, 1] [2023-11-06 21:16:18,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:18,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 21:16:18,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:16:18,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash -574688863, now seen corresponding path program 1 times [2023-11-06 21:16:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338875322] [2023-11-06 21:16:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:18,999 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:16:18,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239695002] [2023-11-06 21:16:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:18,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:19,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:19,001 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:19,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 21:16:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:19,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 21:16:19,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:19,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:16:20,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:20,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:20,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:20,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:20,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:20,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:20,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:20,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:21,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:21,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:21,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:21,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:22,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:22,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:22,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:22,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:23,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:23,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:23,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:23,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:23,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:23,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:16:23,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2023-11-06 21:16:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 165 proven. 228 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 21:16:23,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338875322] [2023-11-06 21:16:29,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:16:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239695002] [2023-11-06 21:16:29,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239695002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:29,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:16:29,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-11-06 21:16:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758629579] [2023-11-06 21:16:29,746 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:29,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:16:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:16:29,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=174, Unknown=8, NotChecked=0, Total=240 [2023-11-06 21:16:29,748 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 21:16:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:16:31,537 INFO L93 Difference]: Finished difference Result 359 states and 440 transitions. [2023-11-06 21:16:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:16:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 159 [2023-11-06 21:16:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:16:31,540 INFO L225 Difference]: With dead ends: 359 [2023-11-06 21:16:31,540 INFO L226 Difference]: Without dead ends: 189 [2023-11-06 21:16:31,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=132, Invalid=322, Unknown=8, NotChecked=0, Total=462 [2023-11-06 21:16:31,543 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 146 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:16:31,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 315 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 21:16:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-06 21:16:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2023-11-06 21:16:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 148 states have (on average 1.2094594594594594) internal successors, (179), 149 states have internal predecessors, (179), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 21:16:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2023-11-06 21:16:31,594 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 159 [2023-11-06 21:16:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:16:31,596 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2023-11-06 21:16:31,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 21:16:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2023-11-06 21:16:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 21:16:31,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:16:31,599 INFO L195 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, 1, 1, 1, 1, 1] [2023-11-06 21:16:31,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:31,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:31,807 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:16:31,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash -708702369, now seen corresponding path program 1 times [2023-11-06 21:16:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:31,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27842221] [2023-11-06 21:16:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:31,849 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:16:31,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826835070] [2023-11-06 21:16:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:31,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:31,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:31,851 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:31,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 21:16:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:32,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 21:16:32,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:33,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:16:33,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:33,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 21:16:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-06 21:16:33,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27842221] [2023-11-06 21:16:33,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:16:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826835070] [2023-11-06 21:16:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826835070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:33,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:16:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698231167] [2023-11-06 21:16:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:33,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:16:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:16:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:16:33,410 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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) [2023-11-06 21:16:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:16:33,913 INFO L93 Difference]: Finished difference Result 369 states and 445 transitions. [2023-11-06 21:16:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:16:33,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 159 [2023-11-06 21:16:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:16:33,915 INFO L225 Difference]: With dead ends: 369 [2023-11-06 21:16:33,915 INFO L226 Difference]: Without dead ends: 195 [2023-11-06 21:16:33,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:16:33,917 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 81 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:16:33,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 411 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:16:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-06 21:16:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2023-11-06 21:16:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.185897435897436) internal successors, (185), 157 states have internal predecessors, (185), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-06 21:16:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2023-11-06 21:16:33,959 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 159 [2023-11-06 21:16:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:16:33,962 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2023-11-06 21:16:33,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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) [2023-11-06 21:16:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2023-11-06 21:16:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-06 21:16:33,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:16:33,965 INFO L195 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:33,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:34,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:34,166 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:16:34,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 343831514, now seen corresponding path program 1 times [2023-11-06 21:16:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217879599] [2023-11-06 21:16:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:34,204 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:16:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233572996] [2023-11-06 21:16:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:34,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:34,206 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:34,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 21:16:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:16:34,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:16:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:16:35,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:16:35,197 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:16:35,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:16:35,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 21:16:35,411 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:35,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:16:35,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:16:35 BoogieIcfgContainer [2023-11-06 21:16:35,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:16:35,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:16:35,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:16:35,557 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:16:35,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:38" (3/4) ... [2023-11-06 21:16:35,560 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:16:35,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:16:35,562 INFO L158 Benchmark]: Toolchain (without parser) took 118137.05ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 138.2MB in the beginning and 197.3MB in the end (delta: -59.1MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2023-11-06 21:16:35,562 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 134.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:16:35,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.51ms. Allocated memory is still 184.5MB. Free memory was 138.2MB in the beginning and 123.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:16:35,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.64ms. Allocated memory is still 184.5MB. Free memory was 123.0MB in the beginning and 119.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:16:35,563 INFO L158 Benchmark]: Boogie Preprocessor took 65.36ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 116.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:16:35,563 INFO L158 Benchmark]: RCFGBuilder took 883.06ms. Allocated memory is still 184.5MB. Free memory was 116.1MB in the beginning and 137.7MB in the end (delta: -21.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-06 21:16:35,564 INFO L158 Benchmark]: TraceAbstraction took 116722.16ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 136.7MB in the beginning and 197.3MB in the end (delta: -60.7MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. [2023-11-06 21:16:35,564 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 388.0MB. Free memory is still 197.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:16:35,566 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.29ms. Allocated memory is still 134.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.51ms. Allocated memory is still 184.5MB. Free memory was 138.2MB in the beginning and 123.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.64ms. Allocated memory is still 184.5MB. Free memory was 123.0MB in the beginning and 119.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.36ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 116.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 883.06ms. Allocated memory is still 184.5MB. Free memory was 116.1MB in the beginning and 137.7MB in the end (delta: -21.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 116722.16ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 136.7MB in the beginning and 197.3MB in the end (delta: -60.7MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 388.0MB. Free memory is still 197.3MB. 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 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] double_Array_0[0] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[0]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [(double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=8000005/8, double_Array_0[0]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [(double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=8000005/8, double_Array_0[0]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1]=333/20, double_Array_0[1]=333/20, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [(double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F=1, double_Array_0[1]=333/20, double_Array_0[1]=333/20, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [(double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F=1, double_Array_0[1]=333/20, double_Array_0[1]=333/20, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[1][0]=33, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[1][0]=33, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[1][0]=33, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[1][0]=33, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR 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, signed_char_Array_0={7:0}, signed_char_Array_0[0][1]=97, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][1]=97, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR 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, signed_char_Array_0={7:0}, signed_char_Array_0[0][1]=97, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][1]=97, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L83] EXPR signed_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, signed_char_Array_0={7:0}, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_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, signed_char_Array_0={7:0}, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[0][2] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][2]=4, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][2]=4, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][2]=4, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][2]=4, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L89] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=3] [L89] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=3] [L90] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=3] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=3] [L91] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=3] [L91] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=3] [L104] RET updateVariables() [L105] CALL step() [L43] EXPR signed_char_Array_0[0][2] [L43] EXPR signed_char_Array_0[1][1] [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][0] [L43] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] signed_char_Array_0[1][2] = ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))) [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] EXPR signed_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, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR signed_char_Array_0[0][0] & signed_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, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1]); [L45] EXPR 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, signed_char_Array_0={7:0}, signed_char_Array_0[0][1]=97, signed_short_int_Array_0={8:0}, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(stepLocal_0 >= signed_char_Array_0[0][1]) [L48] EXPR double_Array_0[0] [L48] double_Array_0[2] = double_Array_0[0] [L50] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][2]=4, signed_short_int_Array_0={8:0}, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) [L50] EXPR signed_char_Array_0[0][2] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) VAL [((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])=4, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][2]=4, signed_char_Array_0[0][2]=4, signed_short_int_Array_0={8:0}, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L50] signed_short_int_Array_0[0] = ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))) [L51] EXPR signed_char_Array_0[0][0] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed long int stepLocal_1 = signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]; [L52] COND FALSE !(stepLocal_1 < -100) [L55] EXPR BOOL_unsigned_char_Array_0[2] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, stepLocal_1=21, unsigned_short_int_Array_0={9:0}] [L55] BOOL_unsigned_char_Array_0[0] = (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] float_Array_0[0] = double_Array_0[1] [L58] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, stepLocal_1=21, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L59] EXPR signed_char_Array_0[1][0] [L59] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[1][0]=33, signed_short_int_Array_0={8:0}, stepLocal_0=0, stepLocal_1=21, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) [L59] EXPR signed_char_Array_0[0][0] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) VAL [((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1)=63, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[1][0]=33, signed_short_int_Array_0={8:0}, stepLocal_0=0, stepLocal_1=21, unsigned_short_int_Array_0={9:0}] [L59] unsigned_short_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR signed_char_Array_0[1][2] [L96] EXPR signed_char_Array_0[0][2] [L96] EXPR signed_char_Array_0[1][1] [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] [L96] EXPR signed_char_Array_0[1][1] VAL [((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][1] VAL [((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) [L96] EXPR double_Array_0[2] [L96] EXPR double_Array_0[0] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) VAL [(((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))=0, ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[2]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [(((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))=0, ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[2]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [(((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))=0, ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))=0, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[2]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [(((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)=0, (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))=0, ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))=0, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[2]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))=0, (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)=0, (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))=0, ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))=0, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[2]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [(((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))=0, ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))=0, (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)=0, (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))=0, ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))=97, ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))=0, (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=8000005/8, double_Array_0[2]=8000005/8, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0[0][0] & signed_char_Array_0[1][1]=0, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][0]=63, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][1]=97, signed_char_Array_0[0][2]=4, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][0]=33, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][1]=0, signed_char_Array_0[1][2]=-93, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96-L97] return (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 116.5s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4371 SdHoareTripleChecker+Valid, 21.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4306 mSDsluCounter, 9532 SdHoareTripleChecker+Invalid, 19.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7912 mSDsCounter, 726 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12567 IncrementalHoareTripleChecker+Invalid, 13293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 726 mSolverCounterUnsat, 1620 mSDtfsCounter, 12567 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2503 GetRequests, 2151 SyntacticMatches, 1 SemanticMatches, 351 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 3693 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=14, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 713 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 74.4s InterpolantComputationTime, 2484 NumberOfCodeBlocks, 2484 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2156 ConstructedInterpolants, 1 QuantifiedInterpolants, 44846 SizeOfPredicates, 173 NumberOfNonLiveVariables, 7714 ConjunctsInSsa, 482 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 8190/9576 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 [2023-11-06 21:16:35,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:16:38,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:16:38,225 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:16:38,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:16:38,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:16:38,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:16:38,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:16:38,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:16:38,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:16:38,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:16:38,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:16:38,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:16:38,268 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:16:38,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:16:38,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:16:38,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:16:38,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:16:38,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:16:38,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:16:38,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:16:38,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:16:38,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:16:38,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:16:38,275 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:16:38,276 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:16:38,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:16:38,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:16:38,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:16:38,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:16:38,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:16:38,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:16:38,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:16:38,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:16:38,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:16:38,281 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:16:38,281 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:16:38,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:16:38,282 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:16:38,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:16:38,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:16:38,283 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:16:38,283 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:16:38,284 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_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2023-11-06 21:16:38,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:16:38,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:16:38,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:16:38,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:16:38,701 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:16:38,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2023-11-06 21:16:41,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:16:42,120 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:16:42,121 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2023-11-06 21:16:42,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data/a93cc9d1d/20dbd346e8814c24bd7f251e35aef295/FLAG083c31a26 [2023-11-06 21:16:42,153 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/data/a93cc9d1d/20dbd346e8814c24bd7f251e35aef295 [2023-11-06 21:16:42,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:16:42,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:16:42,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:16:42,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:16:42,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:16:42,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5025a327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42, skipping insertion in model container [2023-11-06 21:16:42,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,217 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:16:42,412 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i[916,929] [2023-11-06 21:16:42,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:16:42,551 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:16:42,569 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i[916,929] [2023-11-06 21:16:42,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:16:42,683 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:16:42,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42 WrapperNode [2023-11-06 21:16:42,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:16:42,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:16:42,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:16:42,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:16:42,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,787 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 388 [2023-11-06 21:16:42,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:16:42,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:16:42,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:16:42,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:16:42,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:16:42,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:16:42,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:16:42,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:16:42,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2023-11-06 21:16:42,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:16:42,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:42,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:16:42,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:16:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:16:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 21:16:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 21:16:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:16:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 21:16:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:16:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:16:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 21:16:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 21:16:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:16:43,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:16:43,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:16:43,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:16:43,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:16:43,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:16:43,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:16:43,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 21:16:43,140 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:16:43,150 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:16:44,193 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:16:44,202 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:16:44,202 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:16:44,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:44 BoogieIcfgContainer [2023-11-06 21:16:44,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:16:44,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:16:44,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:16:44,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:16:44,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:42" (1/3) ... [2023-11-06 21:16:44,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec45fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:44, skipping insertion in model container [2023-11-06 21:16:44,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (2/3) ... [2023-11-06 21:16:44,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec45fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:44, skipping insertion in model container [2023-11-06 21:16:44,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:44" (3/3) ... [2023-11-06 21:16:44,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2023-11-06 21:16:44,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:16:44,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:16:44,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:16:44,330 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1616e6f9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:16:44,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:16:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 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) [2023-11-06 21:16:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 21:16:44,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:16:44,353 INFO L195 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] [2023-11-06 21:16:44,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:16:44,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 923876049, now seen corresponding path program 1 times [2023-11-06 21:16:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874560371] [2023-11-06 21:16:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:44,375 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 [2023-11-06 21:16:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:44,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 21:16:44,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:16:44,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 139 [2023-11-06 21:16:44,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:16:44,937 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 21:16:44,942 INFO L158 Benchmark]: Toolchain (without parser) took 2779.87ms. Allocated memory was 83.9MB in the beginning and 119.5MB in the end (delta: 35.7MB). Free memory was 60.3MB in the beginning and 72.7MB in the end (delta: -12.4MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-11-06 21:16:44,942 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:16:44,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.75ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 43.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:16:44,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.69ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 40.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:16:44,944 INFO L158 Benchmark]: Boogie Preprocessor took 147.97ms. Allocated memory was 83.9MB in the beginning and 119.5MB in the end (delta: 35.7MB). Free memory was 40.1MB in the beginning and 96.6MB in the end (delta: -56.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2023-11-06 21:16:44,945 INFO L158 Benchmark]: RCFGBuilder took 1267.66ms. Allocated memory is still 119.5MB. Free memory was 96.1MB in the beginning and 63.0MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 21:16:44,949 INFO L158 Benchmark]: TraceAbstraction took 732.09ms. Allocated memory is still 119.5MB. Free memory was 62.5MB in the beginning and 72.7MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:16:44,957 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.27ms. Allocated memory is still 83.9MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.75ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 43.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.69ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 40.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 147.97ms. Allocated memory was 83.9MB in the beginning and 119.5MB in the end (delta: 35.7MB). Free memory was 40.1MB in the beginning and 96.6MB in the end (delta: -56.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1267.66ms. Allocated memory is still 119.5MB. Free memory was 96.1MB in the beginning and 63.0MB in the end (delta: 33.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 732.09ms. Allocated memory is still 119.5MB. Free memory was 62.5MB in the beginning and 72.7MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 21:16:44,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09aee444-5180-40c2-8cc0-f37037e8b1a6/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.