./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS --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 7aff0c23635f1e1acd85672a1024d6cb6d0af57cad0028c56f5d301198b4eae6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:24:46,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:24:46,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:24:46,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:24:46,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:24:46,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:24:46,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:24:46,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:24:46,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:24:46,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:24:46,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:24:46,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:24:46,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:24:46,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:24:46,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:24:46,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:24:46,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:24:46,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:24:46,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:24:46,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:24:46,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:24:46,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:24:46,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:24:46,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:24:46,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:24:46,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:24:46,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:24:46,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:24:46,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:24:46,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:24:46,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:24:46,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:24:46,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:24:46,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:24:46,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:24:46,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:24:46,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:24:46,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:24:46,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:24:46,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:24:46,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:24:46,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:24:46,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:24:46,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:24:46,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:24:46,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:24:46,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:24:46,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:24:46,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:24:46,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:24:46,894 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:24:46,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:24:46,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:24:46,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:24:46,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:24:46,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:24:46,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:24:46,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:24:46,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:24:46,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:24:46,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:24:46,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:24:46,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:24:46,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:24:46,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:24:46,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:24:46,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:24:46,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:24:46,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:24:46,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:24:46,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:24:46,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:24:46,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:24:46,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:24:46,901 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:24:46,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:24:46,902 INFO L138 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_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/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_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS 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 -> 7aff0c23635f1e1acd85672a1024d6cb6d0af57cad0028c56f5d301198b4eae6 [2022-11-23 03:24:47,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:24:47,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:24:47,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:24:47,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:24:47,284 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:24:47,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-11-23 03:24:50,309 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:24:50,513 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:24:50,514 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-11-23 03:24:50,521 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/data/f882ff6cb/119fbeb6f4e04186aa5eb73c6fb57d31/FLAG5763d9951 [2022-11-23 03:24:50,541 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/data/f882ff6cb/119fbeb6f4e04186aa5eb73c6fb57d31 [2022-11-23 03:24:50,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:24:50,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:24:50,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:24:50,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:24:50,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:24:50,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a89b025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50, skipping insertion in model container [2022-11-23 03:24:50,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:24:50,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:24:50,818 WARN L237 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_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c[573,586] [2022-11-23 03:24:50,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:24:50,851 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:24:50,868 WARN L237 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_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c[573,586] [2022-11-23 03:24:50,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:24:50,900 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:24:50,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50 WrapperNode [2022-11-23 03:24:50,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:24:50,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:24:50,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:24:50,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:24:50,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,933 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-11-23 03:24:50,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:24:50,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:24:50,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:24:50,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:24:50,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,972 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:24:50,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:24:50,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:24:50,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:24:50,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (1/1) ... [2022-11-23 03:24:50,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:24:51,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:51,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:24:51,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:24:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:24:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 03:24:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 03:24:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:24:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:24:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:24:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 03:24:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 03:24:51,142 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:24:51,145 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:24:51,289 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:24:51,295 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:24:51,295 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:24:51,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:51 BoogieIcfgContainer [2022-11-23 03:24:51,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:24:51,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:24:51,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:24:51,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:24:51,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:24:50" (1/3) ... [2022-11-23 03:24:51,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1743c35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:24:51, skipping insertion in model container [2022-11-23 03:24:51,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:50" (2/3) ... [2022-11-23 03:24:51,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1743c35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:24:51, skipping insertion in model container [2022-11-23 03:24:51,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:51" (3/3) ... [2022-11-23 03:24:51,306 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound50.c [2022-11-23 03:24:51,327 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:24:51,327 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:24:51,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:24:51,384 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;@11cc70e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:24:51,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:24:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 03:24:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 03:24:51,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:51,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:51,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-11-23 03:24:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:51,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772511681] [2022-11-23 03:24:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772511681] [2022-11-23 03:24:51,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-23 03:24:51,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203274122] [2022-11-23 03:24:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:51,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:51,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:24:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:51,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 03:24:51,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:24:51,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:24:51,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203274122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:24:51,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:24:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:24:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390647984] [2022-11-23 03:24:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:24:51,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:24:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:24:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:24:51,820 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:24:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:51,850 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-11-23 03:24:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:24:51,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-23 03:24:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:51,864 INFO L225 Difference]: With dead ends: 47 [2022-11-23 03:24:51,864 INFO L226 Difference]: Without dead ends: 21 [2022-11-23 03:24:51,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:24:51,873 INFO L413 NwaCegarLoop]: 29 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, 29 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 [2022-11-23 03:24:51,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:24:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-23 03:24:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-23 03:24:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:24:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-23 03:24:51,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-11-23 03:24:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:51,915 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-23 03:24:51,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:24:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-23 03:24:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 03:24:51,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:51,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:51,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:24:52,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-23 03:24:52,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-11-23 03:24:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:52,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780243304] [2022-11-23 03:24:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:52,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:52,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327768321] [2022-11-23 03:24:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:52,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:52,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:52,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:24:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:52,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:24:52,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:52,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:24:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:52,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780243304] [2022-11-23 03:24:52,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:52,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327768321] [2022-11-23 03:24:52,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327768321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:24:52,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:24:52,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:24:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347613851] [2022-11-23 03:24:52,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:24:52,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:24:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:24:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:24:52,311 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:24:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:52,329 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-23 03:24:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:24:52,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-23 03:24:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:52,330 INFO L225 Difference]: With dead ends: 30 [2022-11-23 03:24:52,331 INFO L226 Difference]: Without dead ends: 23 [2022-11-23 03:24:52,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:24:52,332 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:24:52,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:24:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-23 03:24:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-23 03:24:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:24:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-23 03:24:52,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-11-23 03:24:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:52,341 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-23 03:24:52,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:24:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-23 03:24:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 03:24:52,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:52,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:52,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 03:24:52,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:52,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-11-23 03:24:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:52,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385187592] [2022-11-23 03:24:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:52,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:52,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103616766] [2022-11-23 03:24:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:52,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:52,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:52,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:24:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:52,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 03:24:52,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:24:52,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:24:52,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385187592] [2022-11-23 03:24:52,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103616766] [2022-11-23 03:24:52,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103616766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:24:52,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:24:52,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:24:52,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449022987] [2022-11-23 03:24:52,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:24:52,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:24:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:24:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:24:52,817 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:24:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:52,938 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-23 03:24:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:24:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-23 03:24:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:52,942 INFO L225 Difference]: With dead ends: 33 [2022-11-23 03:24:52,945 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 03:24:52,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:24:52,948 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:24:52,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:24:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 03:24:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-23 03:24:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 03:24:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-23 03:24:52,965 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-11-23 03:24:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:52,967 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-23 03:24:52,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:24:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-23 03:24:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 03:24:52,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:52,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:52,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:24:53,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:53,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-11-23 03:24:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:53,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195913996] [2022-11-23 03:24:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:53,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:53,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325782504] [2022-11-23 03:24:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:53,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:53,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:53,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:53,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:24:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:53,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 03:24:53,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:24:53,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:24:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:53,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195913996] [2022-11-23 03:24:53,775 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:53,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325782504] [2022-11-23 03:24:53,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325782504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:24:53,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:24:53,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2022-11-23 03:24:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340673591] [2022-11-23 03:24:53,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:24:53,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 03:24:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 03:24:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:24:53,779 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 03:24:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:53,985 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-11-23 03:24:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:24:53,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2022-11-23 03:24:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:53,990 INFO L225 Difference]: With dead ends: 35 [2022-11-23 03:24:53,990 INFO L226 Difference]: Without dead ends: 30 [2022-11-23 03:24:53,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-23 03:24:53,992 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:24:53,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 92 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:24:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-23 03:24:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-11-23 03:24:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:24:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-11-23 03:24:54,003 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-11-23 03:24:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:54,007 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-11-23 03:24:54,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 03:24:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-11-23 03:24:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 03:24:54,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:54,008 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:54,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:24:54,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:54,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:54,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-11-23 03:24:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809227812] [2022-11-23 03:24:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:54,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:54,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:54,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701399929] [2022-11-23 03:24:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:54,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:54,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:54,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:24:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:54,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:24:54,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:54,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:24:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809227812] [2022-11-23 03:24:54,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701399929] [2022-11-23 03:24:54,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701399929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:24:54,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:24:54,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-23 03:24:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072415456] [2022-11-23 03:24:54,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:24:54,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:24:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:24:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:24:54,437 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 03:24:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:54,519 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-11-23 03:24:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:24:54,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-11-23 03:24:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:54,524 INFO L225 Difference]: With dead ends: 57 [2022-11-23 03:24:54,524 INFO L226 Difference]: Without dead ends: 52 [2022-11-23 03:24:54,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:24:54,525 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:24:54,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:24:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-23 03:24:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-23 03:24:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 03:24:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-23 03:24:54,539 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2022-11-23 03:24:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:54,539 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-23 03:24:54,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 03:24:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-23 03:24:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-23 03:24:54,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:54,541 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:54,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:24:54,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:54,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-11-23 03:24:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:54,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723844799] [2022-11-23 03:24:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:54,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:54,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311647735] [2022-11-23 03:24:54,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:24:54,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:54,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:54,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:24:54,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:24:54,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:24:54,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 03:24:54,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:54,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:24:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 03:24:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:55,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723844799] [2022-11-23 03:24:55,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:55,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311647735] [2022-11-23 03:24:55,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311647735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:24:55,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:24:55,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-23 03:24:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244491311] [2022-11-23 03:24:55,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:24:55,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:24:55,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:24:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:24:55,150 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-23 03:24:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:55,378 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-11-23 03:24:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 03:24:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2022-11-23 03:24:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:55,380 INFO L225 Difference]: With dead ends: 111 [2022-11-23 03:24:55,381 INFO L226 Difference]: Without dead ends: 106 [2022-11-23 03:24:55,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-23 03:24:55,382 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 120 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:24:55,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:24:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-23 03:24:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-23 03:24:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-23 03:24:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-11-23 03:24:55,406 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2022-11-23 03:24:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:55,406 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-11-23 03:24:55,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-23 03:24:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-11-23 03:24:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-23 03:24:55,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:55,410 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:55,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:24:55,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 03:24:55,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2022-11-23 03:24:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:55,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273629937] [2022-11-23 03:24:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:55,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:55,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633442006] [2022-11-23 03:24:55,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:24:55,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:55,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:55,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:24:55,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-23 03:24:55,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:24:55,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 03:24:55,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:56,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:24:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-11-23 03:24:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273629937] [2022-11-23 03:24:56,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633442006] [2022-11-23 03:24:56,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633442006] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:24:56,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:24:56,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-23 03:24:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102442409] [2022-11-23 03:24:56,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:24:56,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 03:24:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 03:24:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-23 03:24:56,461 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-23 03:24:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:24:57,017 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2022-11-23 03:24:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 03:24:57,018 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 109 [2022-11-23 03:24:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:24:57,027 INFO L225 Difference]: With dead ends: 219 [2022-11-23 03:24:57,027 INFO L226 Difference]: Without dead ends: 214 [2022-11-23 03:24:57,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 03:24:57,031 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 262 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:24:57,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 232 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:24:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-23 03:24:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-23 03:24:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 165 states have (on average 1.1393939393939394) internal successors, (188), 165 states have internal predecessors, (188), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-23 03:24:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2022-11-23 03:24:57,095 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 109 [2022-11-23 03:24:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:24:57,095 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2022-11-23 03:24:57,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-23 03:24:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2022-11-23 03:24:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-23 03:24:57,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:24:57,108 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:24:57,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:24:57,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:57,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:24:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:24:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1216739502, now seen corresponding path program 4 times [2022-11-23 03:24:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:24:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165805099] [2022-11-23 03:24:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:24:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:24:57,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:24:57,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089754626] [2022-11-23 03:24:57,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:24:57,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:57,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:57,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:24:57,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:24:57,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:24:57,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 03:24:57,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:24:58,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:24:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-11-23 03:24:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:59,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165805099] [2022-11-23 03:24:59,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:24:59,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089754626] [2022-11-23 03:24:59,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089754626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:24:59,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:24:59,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-23 03:24:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096290341] [2022-11-23 03:24:59,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:24:59,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 03:24:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:24:59,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 03:24:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 03:24:59,256 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-23 03:25:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:25:01,080 INFO L93 Difference]: Finished difference Result 435 states and 505 transitions. [2022-11-23 03:25:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-23 03:25:01,081 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 217 [2022-11-23 03:25:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:25:01,084 INFO L225 Difference]: With dead ends: 435 [2022-11-23 03:25:01,084 INFO L226 Difference]: Without dead ends: 430 [2022-11-23 03:25:01,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-23 03:25:01,089 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 715 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:25:01,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 494 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:25:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-23 03:25:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-11-23 03:25:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 333 states have (on average 1.1411411411411412) internal successors, (380), 333 states have internal predecessors, (380), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-23 03:25:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2022-11-23 03:25:01,152 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 217 [2022-11-23 03:25:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:25:01,153 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2022-11-23 03:25:01,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-23 03:25:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2022-11-23 03:25:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-11-23 03:25:01,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:25:01,161 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:25:01,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:25:01,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:25:01,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:25:01,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:25:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash -623866926, now seen corresponding path program 5 times [2022-11-23 03:25:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:25:01,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755797804] [2022-11-23 03:25:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:25:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:25:01,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:25:01,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775731362] [2022-11-23 03:25:01,406 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:25:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:25:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:25:01,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:25:01,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 03:25:01,886 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-11-23 03:25:01,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:25:01,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-23 03:25:01,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:25:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:25:03,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:25:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-11-23 03:25:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:25:05,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755797804] [2022-11-23 03:25:05,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 03:25:05,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775731362] [2022-11-23 03:25:05,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775731362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:25:05,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:25:05,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-23 03:25:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399128291] [2022-11-23 03:25:05,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:25:05,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-23 03:25:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:25:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-23 03:25:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-23 03:25:05,405 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-11-23 03:25:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:25:07,420 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2022-11-23 03:25:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-23 03:25:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) Word has length 433 [2022-11-23 03:25:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:25:07,424 INFO L225 Difference]: With dead ends: 471 [2022-11-23 03:25:07,425 INFO L226 Difference]: Without dead ends: 466 [2022-11-23 03:25:07,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 768 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-23 03:25:07,428 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 604 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:25:07,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 535 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:25:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-23 03:25:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2022-11-23 03:25:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 361 states have (on average 1.1412742382271468) internal successors, (412), 361 states have internal predecessors, (412), 53 states have call successors, (53), 52 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-23 03:25:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 517 transitions. [2022-11-23 03:25:07,467 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 517 transitions. Word has length 433 [2022-11-23 03:25:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:25:07,468 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 517 transitions. [2022-11-23 03:25:07,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-11-23 03:25:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 517 transitions. [2022-11-23 03:25:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-11-23 03:25:07,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:25:07,479 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:25:07,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:25:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:25:07,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:25:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:25:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash -872711022, now seen corresponding path program 6 times [2022-11-23 03:25:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:25:07,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526777410] [2022-11-23 03:25:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:25:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:25:07,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 03:25:07,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486123590] [2022-11-23 03:25:07,720 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 03:25:07,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:25:07,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:25:07,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:25:07,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 03:25:08,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-11-23 03:25:08,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 03:25:08,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:25:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:25:08,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:25:08,647 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:25:08,648 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 03:25:08,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:25:08,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:25:08,868 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-11-23 03:25:08,872 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:25:09,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:25:09 BoogieIcfgContainer [2022-11-23 03:25:09,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:25:09,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:25:09,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:25:09,055 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:25:09,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:51" (3/4) ... [2022-11-23 03:25:09,058 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:25:09,228 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:25:09,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:25:09,229 INFO L158 Benchmark]: Toolchain (without parser) took 18683.75ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 153.3MB in the beginning and 240.6MB in the end (delta: -87.3MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2022-11-23 03:25:09,229 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:25:09,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.08ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 155.6MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 03:25:09,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.25ms. Allocated memory is still 190.8MB. Free memory was 155.6MB in the beginning and 153.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:25:09,230 INFO L158 Benchmark]: Boogie Preprocessor took 45.28ms. Allocated memory is still 190.8MB. Free memory was 153.9MB in the beginning and 153.1MB in the end (delta: 854.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:25:09,231 INFO L158 Benchmark]: RCFGBuilder took 316.28ms. Allocated memory is still 190.8MB. Free memory was 153.1MB in the beginning and 142.0MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 03:25:09,232 INFO L158 Benchmark]: TraceAbstraction took 17754.65ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 141.4MB in the beginning and 98.5MB in the end (delta: 42.9MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2022-11-23 03:25:09,233 INFO L158 Benchmark]: Witness Printer took 173.55ms. Allocated memory is still 276.8MB. Free memory was 98.5MB in the beginning and 240.6MB in the end (delta: -142.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 03:25:09,235 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.08ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 155.6MB in the end (delta: -2.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.25ms. Allocated memory is still 190.8MB. Free memory was 155.6MB in the beginning and 153.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.28ms. Allocated memory is still 190.8MB. Free memory was 153.9MB in the beginning and 153.1MB in the end (delta: 854.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.28ms. Allocated memory is still 190.8MB. Free memory was 153.1MB in the beginning and 142.0MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17754.65ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 141.4MB in the beginning and 98.5MB in the end (delta: 42.9MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 173.55ms. Allocated memory is still 276.8MB. Free memory was 98.5MB in the beginning and 240.6MB in the end (delta: -142.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [counter=0, unknown-#in~cond-unknown=1] [L13] COND FALSE !(!cond) VAL [cond=1, counter=0, unknown-#in~cond-unknown=1] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=51, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [counter=0, unknown-#in~cond-unknown=1] [L13] COND FALSE !(!cond) VAL [cond=1, counter=0, unknown-#in~cond-unknown=1] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=51, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=51, x2=1, y1=0, y2=0, y3=51] [L36] EXPR counter++ VAL [counter=1, counter++=0, x1=51, x2=1, y1=0, y2=0, y3=51] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=51, x2=1, y1=0, y2=0, y3=51] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=51, x2=1, y1=0, y2=0, y3=51] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=51, x2=1, y1=1, y2=0, y3=50] [L36] EXPR counter++ VAL [counter=2, counter++=1, x1=51, x2=1, y1=1, y2=0, y3=50] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=51, x2=1, y1=1, y2=0, y3=50] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=51, x2=1, y1=1, y2=0, y3=50] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=51, x2=1, y1=2, y2=0, y3=49] [L36] EXPR counter++ VAL [counter=3, counter++=2, x1=51, x2=1, y1=2, y2=0, y3=49] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=51, x2=1, y1=2, y2=0, y3=49] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=51, x2=1, y1=2, y2=0, y3=49] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=51, x2=1, y1=3, y2=0, y3=48] [L36] EXPR counter++ VAL [counter=4, counter++=3, x1=51, x2=1, y1=3, y2=0, y3=48] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=51, x2=1, y1=3, y2=0, y3=48] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=51, x2=1, y1=3, y2=0, y3=48] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=51, x2=1, y1=4, y2=0, y3=47] [L36] EXPR counter++ VAL [counter=5, counter++=4, x1=51, x2=1, y1=4, y2=0, y3=47] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=51, x2=1, y1=4, y2=0, y3=47] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=51, x2=1, y1=4, y2=0, y3=47] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=51, x2=1, y1=5, y2=0, y3=46] [L36] EXPR counter++ VAL [counter=6, counter++=5, x1=51, x2=1, y1=5, y2=0, y3=46] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=51, x2=1, y1=5, y2=0, y3=46] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=51, x2=1, y1=5, y2=0, y3=46] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=51, x2=1, y1=6, y2=0, y3=45] [L36] EXPR counter++ VAL [counter=7, counter++=6, x1=51, x2=1, y1=6, y2=0, y3=45] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=51, x2=1, y1=6, y2=0, y3=45] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=51, x2=1, y1=6, y2=0, y3=45] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=51, x2=1, y1=7, y2=0, y3=44] [L36] EXPR counter++ VAL [counter=8, counter++=7, x1=51, x2=1, y1=7, y2=0, y3=44] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=51, x2=1, y1=7, y2=0, y3=44] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=51, x2=1, y1=7, y2=0, y3=44] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=51, x2=1, y1=8, y2=0, y3=43] [L36] EXPR counter++ VAL [counter=9, counter++=8, x1=51, x2=1, y1=8, y2=0, y3=43] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=51, x2=1, y1=8, y2=0, y3=43] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=51, x2=1, y1=8, y2=0, y3=43] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=51, x2=1, y1=9, y2=0, y3=42] [L36] EXPR counter++ VAL [counter=10, counter++=9, x1=51, x2=1, y1=9, y2=0, y3=42] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=51, x2=1, y1=9, y2=0, y3=42] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=51, x2=1, y1=9, y2=0, y3=42] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=51, x2=1, y1=10, y2=0, y3=41] [L36] EXPR counter++ VAL [counter=11, counter++=10, x1=51, x2=1, y1=10, y2=0, y3=41] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=51, x2=1, y1=10, y2=0, y3=41] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=51, x2=1, y1=10, y2=0, y3=41] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=51, x2=1, y1=11, y2=0, y3=40] [L36] EXPR counter++ VAL [counter=12, counter++=11, x1=51, x2=1, y1=11, y2=0, y3=40] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=51, x2=1, y1=11, y2=0, y3=40] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=51, x2=1, y1=11, y2=0, y3=40] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=51, x2=1, y1=12, y2=0, y3=39] [L36] EXPR counter++ VAL [counter=13, counter++=12, x1=51, x2=1, y1=12, y2=0, y3=39] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=51, x2=1, y1=12, y2=0, y3=39] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=51, x2=1, y1=12, y2=0, y3=39] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=51, x2=1, y1=13, y2=0, y3=38] [L36] EXPR counter++ VAL [counter=14, counter++=13, x1=51, x2=1, y1=13, y2=0, y3=38] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=51, x2=1, y1=13, y2=0, y3=38] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=51, x2=1, y1=13, y2=0, y3=38] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=51, x2=1, y1=14, y2=0, y3=37] [L36] EXPR counter++ VAL [counter=15, counter++=14, x1=51, x2=1, y1=14, y2=0, y3=37] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=51, x2=1, y1=14, y2=0, y3=37] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=51, x2=1, y1=14, y2=0, y3=37] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=51, x2=1, y1=15, y2=0, y3=36] [L36] EXPR counter++ VAL [counter=16, counter++=15, x1=51, x2=1, y1=15, y2=0, y3=36] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=51, x2=1, y1=15, y2=0, y3=36] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=51, x2=1, y1=15, y2=0, y3=36] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=51, x2=1, y1=16, y2=0, y3=35] [L36] EXPR counter++ VAL [counter=17, counter++=16, x1=51, x2=1, y1=16, y2=0, y3=35] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=51, x2=1, y1=16, y2=0, y3=35] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=51, x2=1, y1=16, y2=0, y3=35] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=51, x2=1, y1=17, y2=0, y3=34] [L36] EXPR counter++ VAL [counter=18, counter++=17, x1=51, x2=1, y1=17, y2=0, y3=34] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=51, x2=1, y1=17, y2=0, y3=34] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=51, x2=1, y1=17, y2=0, y3=34] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=51, x2=1, y1=18, y2=0, y3=33] [L36] EXPR counter++ VAL [counter=19, counter++=18, x1=51, x2=1, y1=18, y2=0, y3=33] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=51, x2=1, y1=18, y2=0, y3=33] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=51, x2=1, y1=18, y2=0, y3=33] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=51, x2=1, y1=19, y2=0, y3=32] [L36] EXPR counter++ VAL [counter=20, counter++=19, x1=51, x2=1, y1=19, y2=0, y3=32] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=51, x2=1, y1=19, y2=0, y3=32] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=51, x2=1, y1=19, y2=0, y3=32] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=51, x2=1, y1=20, y2=0, y3=31] [L36] EXPR counter++ VAL [counter=21, counter++=20, x1=51, x2=1, y1=20, y2=0, y3=31] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=21, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=21, x1=51, x2=1, y1=20, y2=0, y3=31] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=21, x1=51, x2=1, y1=20, y2=0, y3=31] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=21, x1=51, x2=1, y1=21, y2=0, y3=30] [L36] EXPR counter++ VAL [counter=22, counter++=21, x1=51, x2=1, y1=21, y2=0, y3=30] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=22, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=22, x1=51, x2=1, y1=21, y2=0, y3=30] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=22, x1=51, x2=1, y1=21, y2=0, y3=30] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=22, x1=51, x2=1, y1=22, y2=0, y3=29] [L36] EXPR counter++ VAL [counter=23, counter++=22, x1=51, x2=1, y1=22, y2=0, y3=29] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=23, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=23, x1=51, x2=1, y1=22, y2=0, y3=29] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=23, x1=51, x2=1, y1=22, y2=0, y3=29] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=23, x1=51, x2=1, y1=23, y2=0, y3=28] [L36] EXPR counter++ VAL [counter=24, counter++=23, x1=51, x2=1, y1=23, y2=0, y3=28] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=24, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=24, x1=51, x2=1, y1=23, y2=0, y3=28] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=24, x1=51, x2=1, y1=23, y2=0, y3=28] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=24, x1=51, x2=1, y1=24, y2=0, y3=27] [L36] EXPR counter++ VAL [counter=25, counter++=24, x1=51, x2=1, y1=24, y2=0, y3=27] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=25, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=25, x1=51, x2=1, y1=24, y2=0, y3=27] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=25, x1=51, x2=1, y1=24, y2=0, y3=27] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=25, x1=51, x2=1, y1=25, y2=0, y3=26] [L36] EXPR counter++ VAL [counter=26, counter++=25, x1=51, x2=1, y1=25, y2=0, y3=26] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=26, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=26, x1=51, x2=1, y1=25, y2=0, y3=26] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=26, x1=51, x2=1, y1=25, y2=0, y3=26] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=26, x1=51, x2=1, y1=26, y2=0, y3=25] [L36] EXPR counter++ VAL [counter=27, counter++=26, x1=51, x2=1, y1=26, y2=0, y3=25] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=27, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=27, x1=51, x2=1, y1=26, y2=0, y3=25] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=27, x1=51, x2=1, y1=26, y2=0, y3=25] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=27, x1=51, x2=1, y1=27, y2=0, y3=24] [L36] EXPR counter++ VAL [counter=28, counter++=27, x1=51, x2=1, y1=27, y2=0, y3=24] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=28, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=28, x1=51, x2=1, y1=27, y2=0, y3=24] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=28, x1=51, x2=1, y1=27, y2=0, y3=24] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=28, x1=51, x2=1, y1=28, y2=0, y3=23] [L36] EXPR counter++ VAL [counter=29, counter++=28, x1=51, x2=1, y1=28, y2=0, y3=23] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=29, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=29, x1=51, x2=1, y1=28, y2=0, y3=23] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=29, x1=51, x2=1, y1=28, y2=0, y3=23] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=29, x1=51, x2=1, y1=29, y2=0, y3=22] [L36] EXPR counter++ VAL [counter=30, counter++=29, x1=51, x2=1, y1=29, y2=0, y3=22] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=30, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=30, x1=51, x2=1, y1=29, y2=0, y3=22] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=30, x1=51, x2=1, y1=29, y2=0, y3=22] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=30, x1=51, x2=1, y1=30, y2=0, y3=21] [L36] EXPR counter++ VAL [counter=31, counter++=30, x1=51, x2=1, y1=30, y2=0, y3=21] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=31, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=31, x1=51, x2=1, y1=30, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=31, x1=51, x2=1, y1=30, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=31, x1=51, x2=1, y1=31, y2=0, y3=20] [L36] EXPR counter++ VAL [counter=32, counter++=31, x1=51, x2=1, y1=31, y2=0, y3=20] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=32, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=32, x1=51, x2=1, y1=31, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=32, x1=51, x2=1, y1=31, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=32, x1=51, x2=1, y1=32, y2=0, y3=19] [L36] EXPR counter++ VAL [counter=33, counter++=32, x1=51, x2=1, y1=32, y2=0, y3=19] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=33, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=33, x1=51, x2=1, y1=32, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=33, x1=51, x2=1, y1=32, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=33, x1=51, x2=1, y1=33, y2=0, y3=18] [L36] EXPR counter++ VAL [counter=34, counter++=33, x1=51, x2=1, y1=33, y2=0, y3=18] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=34, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=34, x1=51, x2=1, y1=33, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=34, x1=51, x2=1, y1=33, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=34, x1=51, x2=1, y1=34, y2=0, y3=17] [L36] EXPR counter++ VAL [counter=35, counter++=34, x1=51, x2=1, y1=34, y2=0, y3=17] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=35, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=35, x1=51, x2=1, y1=34, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=35, x1=51, x2=1, y1=34, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=35, x1=51, x2=1, y1=35, y2=0, y3=16] [L36] EXPR counter++ VAL [counter=36, counter++=35, x1=51, x2=1, y1=35, y2=0, y3=16] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=36, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=36, x1=51, x2=1, y1=35, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=36, x1=51, x2=1, y1=35, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=36, x1=51, x2=1, y1=36, y2=0, y3=15] [L36] EXPR counter++ VAL [counter=37, counter++=36, x1=51, x2=1, y1=36, y2=0, y3=15] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=37, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=37, x1=51, x2=1, y1=36, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=37, x1=51, x2=1, y1=36, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=37, x1=51, x2=1, y1=37, y2=0, y3=14] [L36] EXPR counter++ VAL [counter=38, counter++=37, x1=51, x2=1, y1=37, y2=0, y3=14] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=38, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=38, x1=51, x2=1, y1=37, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=38, x1=51, x2=1, y1=37, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=38, x1=51, x2=1, y1=38, y2=0, y3=13] [L36] EXPR counter++ VAL [counter=39, counter++=38, x1=51, x2=1, y1=38, y2=0, y3=13] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=39, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=39, x1=51, x2=1, y1=38, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=39, x1=51, x2=1, y1=38, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=39, x1=51, x2=1, y1=39, y2=0, y3=12] [L36] EXPR counter++ VAL [counter=40, counter++=39, x1=51, x2=1, y1=39, y2=0, y3=12] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=40, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=40, x1=51, x2=1, y1=39, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=40, x1=51, x2=1, y1=39, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=40, x1=51, x2=1, y1=40, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=41, counter++=40, x1=51, x2=1, y1=40, y2=0, y3=11] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=41, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=41, x1=51, x2=1, y1=40, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=41, x1=51, x2=1, y1=40, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=41, x1=51, x2=1, y1=41, y2=0, y3=10] [L36] EXPR counter++ VAL [counter=42, counter++=41, x1=51, x2=1, y1=41, y2=0, y3=10] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=42, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=42, x1=51, x2=1, y1=41, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=42, x1=51, x2=1, y1=41, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=42, x1=51, x2=1, y1=42, y2=0, y3=9] [L36] EXPR counter++ VAL [counter=43, counter++=42, x1=51, x2=1, y1=42, y2=0, y3=9] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=43, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=43, x1=51, x2=1, y1=42, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=43, x1=51, x2=1, y1=42, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=43, x1=51, x2=1, y1=43, y2=0, y3=8] [L36] EXPR counter++ VAL [counter=44, counter++=43, x1=51, x2=1, y1=43, y2=0, y3=8] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=44, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=44, x1=51, x2=1, y1=43, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=44, x1=51, x2=1, y1=43, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=44, x1=51, x2=1, y1=44, y2=0, y3=7] [L36] EXPR counter++ VAL [counter=45, counter++=44, x1=51, x2=1, y1=44, y2=0, y3=7] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=45, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=45, x1=51, x2=1, y1=44, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=45, x1=51, x2=1, y1=44, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=45, x1=51, x2=1, y1=45, y2=0, y3=6] [L36] EXPR counter++ VAL [counter=46, counter++=45, x1=51, x2=1, y1=45, y2=0, y3=6] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=46, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=46, x1=51, x2=1, y1=45, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=46, x1=51, x2=1, y1=45, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=46, x1=51, x2=1, y1=46, y2=0, y3=5] [L36] EXPR counter++ VAL [counter=47, counter++=46, x1=51, x2=1, y1=46, y2=0, y3=5] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=47, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=47, x1=51, x2=1, y1=46, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=47, x1=51, x2=1, y1=46, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=47, x1=51, x2=1, y1=47, y2=0, y3=4] [L36] EXPR counter++ VAL [counter=48, counter++=47, x1=51, x2=1, y1=47, y2=0, y3=4] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=48, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=48, x1=51, x2=1, y1=47, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=48, x1=51, x2=1, y1=47, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=48, x1=51, x2=1, y1=48, y2=0, y3=3] [L36] EXPR counter++ VAL [counter=49, counter++=48, x1=51, x2=1, y1=48, y2=0, y3=3] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=49, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=49, x1=51, x2=1, y1=48, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=49, x1=51, x2=1, y1=48, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=49, x1=51, x2=1, y1=49, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=50, counter++=49, x1=51, x2=1, y1=49, y2=0, y3=2] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=50, unknown-#in~cond-unknown=1] [L16] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=50, x1=51, x2=1, y1=49, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=50, x1=51, x2=1, y1=49, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=50, x1=51, x2=1, y1=50, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=51, counter++=50, x1=51, x2=1, y1=50, y2=0, y3=1] [L36] COND FALSE !(counter++<50) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [counter=51, unknown-#in~cond-unknown=0] [L16] COND TRUE !(cond) VAL [cond=0, counter=51, unknown-#in~cond-unknown=0] [L18] reach_error() VAL [cond=0, counter=51, unknown-#in~cond-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1782 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1780 mSDsluCounter, 1756 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1438 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1160 IncrementalHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 318 mSDtfsCounter, 1160 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1908 GetRequests, 1567 SyntacticMatches, 44 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4040 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=9, InterpolantAutomatonStates: 299, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1410 NumberOfCodeBlocks, 1410 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 4483 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2537 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5659/24434 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 proved your program to be incorrect! [2022-11-23 03:25:09,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa14d99b-3aa5-4409-a9da-4b7f7d626a10/bin/uautomizer-QkZJyEgLgS/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE