./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN --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 64bit --witnessprinter.graph.data.programhash 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 --- 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-6b4ec56 [2022-11-20 10:51:34,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:51:34,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:51:34,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:51:34,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:51:34,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:51:34,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:51:34,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:51:34,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:51:34,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:51:34,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:51:34,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:51:34,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:51:34,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:51:34,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:51:34,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:51:34,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:51:34,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:51:34,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:51:34,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:51:34,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:51:34,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:51:34,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:51:34,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:51:34,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:51:34,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:51:34,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:51:34,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:51:34,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:51:34,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:51:34,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:51:34,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:51:34,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:51:34,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:51:34,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:51:34,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:51:34,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:51:34,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:51:34,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:51:34,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:51:34,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:51:34,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:51:34,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:51:34,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:51:34,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:51:34,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:51:34,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:51:34,913 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:51:34,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:51:34,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:51:34,914 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:51:34,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:51:34,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:51:34,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:51:34,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:51:34,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:51:34,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:51:34,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:51:34,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:51:34,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:51:34,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:51:34,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:51:34,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:51:34,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:34,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:51:34,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:51:34,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:51:34,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:51:34,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:51:34,919 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:51:34,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:51:34,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:51:34,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/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_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 [2022-11-20 10:51:35,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:51:35,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:51:35,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:51:35,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:51:35,282 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:51:35,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-20 10:51:38,757 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:51:39,041 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:51:39,042 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-20 10:51:39,050 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data/3f2d0cb17/4bb796d35d2240288470e94741cd9131/FLAG65d5946a9 [2022-11-20 10:51:39,068 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data/3f2d0cb17/4bb796d35d2240288470e94741cd9131 [2022-11-20 10:51:39,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:51:39,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:51:39,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:51:39,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:51:39,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:51:39,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5426232d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39, skipping insertion in model container [2022-11-20 10:51:39,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:51:39,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:51:39,297 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_5e770280-c615-4568-9a70-a6bd191d9a2a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-20 10:51:39,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:51:39,352 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:51:39,369 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_5e770280-c615-4568-9a70-a6bd191d9a2a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-20 10:51:39,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:51:39,404 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:51:39,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39 WrapperNode [2022-11-20 10:51:39,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:51:39,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:51:39,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:51:39,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:51:39,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,448 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-11-20 10:51:39,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:51:39,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:51:39,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:51:39,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:51:39,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,474 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:51:39,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:51:39,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:51:39,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:51:39,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (1/1) ... [2022-11-20 10:51:39,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:51:39,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:51:39,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:51:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:51:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:51:39,767 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:51:39,769 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:51:40,060 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:51:40,069 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:51:40,069 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:51:40,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:40 BoogieIcfgContainer [2022-11-20 10:51:40,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:51:40,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:51:40,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:51:40,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:51:40,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:51:39" (1/3) ... [2022-11-20 10:51:40,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59008c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:51:40, skipping insertion in model container [2022-11-20 10:51:40,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:39" (2/3) ... [2022-11-20 10:51:40,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59008c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:51:40, skipping insertion in model container [2022-11-20 10:51:40,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:40" (3/3) ... [2022-11-20 10:51:40,083 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2022-11-20 10:51:40,123 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:51:40,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:51:40,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:51:40,193 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;@42d9c937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:51:40,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:51:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:51:40,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:40,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:40,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1809708109, now seen corresponding path program 1 times [2022-11-20 10:51:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:40,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231076430] [2022-11-20 10:51:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231076430] [2022-11-20 10:51:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231076430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:40,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:40,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:51:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105823820] [2022-11-20 10:51:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:40,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:51:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:40,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:51:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:51:40,604 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:51:40,619 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-11-20 10:51:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:51:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:51:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:51:40,641 INFO L225 Difference]: With dead ends: 20 [2022-11-20 10:51:40,641 INFO L226 Difference]: Without dead ends: 9 [2022-11-20 10:51:40,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-20 10:51:40,658 INFO L413 NwaCegarLoop]: 9 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, 9 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-20 10:51:40,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:51:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-20 10:51:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-20 10:51:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-20 10:51:40,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-11-20 10:51:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:51:40,692 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-20 10:51:40,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-20 10:51:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:51:40,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:40,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:40,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:51:40,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:40,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767691, now seen corresponding path program 1 times [2022-11-20 10:51:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:40,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423047587] [2022-11-20 10:51:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:41,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423047587] [2022-11-20 10:51:41,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423047587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:41,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:51:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077252996] [2022-11-20 10:51:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:41,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:51:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:51:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:51:41,513 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:51:41,579 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-20 10:51:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:51:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:51:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:51:41,580 INFO L225 Difference]: With dead ends: 16 [2022-11-20 10:51:41,581 INFO L226 Difference]: Without dead ends: 14 [2022-11-20 10:51:41,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:51:41,583 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:51:41,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:51:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-20 10:51:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-20 10:51:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-20 10:51:41,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-11-20 10:51:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:51:41,589 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-20 10:51:41,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-20 10:51:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:51:41,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:41,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:41,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:51:41,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1841040349, now seen corresponding path program 1 times [2022-11-20 10:51:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:41,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702004294] [2022-11-20 10:51:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:51:41,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:51:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:51:42,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:51:42,031 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:51:42,032 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:51:42,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:51:42,038 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-20 10:51:42,042 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:51:42,064 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:51:42,065 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:51:42,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:51:42 BoogieIcfgContainer [2022-11-20 10:51:42,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:51:42,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:51:42,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:51:42,082 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:51:42,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:40" (3/4) ... [2022-11-20 10:51:42,087 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:51:42,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:51:42,089 INFO L158 Benchmark]: Toolchain (without parser) took 3014.89ms. Allocated memory is still 178.3MB. Free memory was 113.4MB in the beginning and 93.2MB in the end (delta: 20.2MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-11-20 10:51:42,090 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 178.3MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:51:42,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.50ms. Allocated memory is still 178.3MB. Free memory was 113.1MB in the beginning and 102.4MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:51:42,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.85ms. Allocated memory is still 178.3MB. Free memory was 102.4MB in the beginning and 100.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:51:42,103 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 178.3MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:51:42,104 INFO L158 Benchmark]: RCFGBuilder took 593.55ms. Allocated memory is still 178.3MB. Free memory was 99.1MB in the beginning and 137.7MB in the end (delta: -38.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:51:42,105 INFO L158 Benchmark]: TraceAbstraction took 2005.21ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 94.3MB in the end (delta: 42.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2022-11-20 10:51:42,105 INFO L158 Benchmark]: Witness Printer took 6.65ms. Allocated memory is still 178.3MB. Free memory was 94.3MB in the beginning and 93.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:51:42,109 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.27ms. Allocated memory is still 178.3MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.50ms. Allocated memory is still 178.3MB. Free memory was 113.1MB in the beginning and 102.4MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.85ms. Allocated memory is still 178.3MB. Free memory was 102.4MB in the beginning and 100.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 178.3MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 593.55ms. Allocated memory is still 178.3MB. Free memory was 99.1MB in the beginning and 137.7MB in the end (delta: -38.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2005.21ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 94.3MB in the end (delta: 42.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 6.65ms. Allocated memory is still 178.3MB. Free memory was 94.3MB in the beginning and 93.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 55, overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L32] const SORT_2 var_5 = 0; [L33] const SORT_2 var_10 = 1; [L34] const SORT_2 var_17 = mask_SORT_2; [L36] SORT_1 input_3; [L37] SORT_1 input_4; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_8_arg_1 = var_5; [L43] state_6 = init_8_arg_1 [L44] SORT_2 init_9_arg_1 = var_5; [L45] state_7 = init_9_arg_1 VAL [init_8_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=8, cond=8] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=8, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=7, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=7, var_14_arg_1=1, var_14_arg_2=0, var_17=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=8, var_22_arg_0=1, var_22_arg_1=7, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=9, cond=9] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 18 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 10:51:42,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN --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 64bit --witnessprinter.graph.data.programhash 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 --- 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-6b4ec56 [2022-11-20 10:51:44,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:51:44,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:51:44,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:51:44,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:51:45,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:51:45,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:51:45,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:51:45,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:51:45,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:51:45,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:51:45,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:51:45,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:51:45,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:51:45,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:51:45,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:51:45,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:51:45,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:51:45,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:51:45,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:51:45,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:51:45,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:51:45,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:51:45,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:51:45,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:51:45,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:51:45,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:51:45,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:51:45,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:51:45,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:51:45,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:51:45,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:51:45,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:51:45,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:51:45,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:51:45,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:51:45,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:51:45,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:51:45,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:51:45,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:51:45,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:51:45,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-20 10:51:45,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:51:45,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:51:45,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:51:45,122 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:51:45,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:51:45,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:51:45,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:51:45,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:51:45,125 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:51:45,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:51:45,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:51:45,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:51:45,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:51:45,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:51:45,127 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:51:45,128 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:51:45,128 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:51:45,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:51:45,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:51:45,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:51:45,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:51:45,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:51:45,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:51:45,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:45,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:51:45,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:51:45,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:51:45,132 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:51:45,132 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:51:45,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:51:45,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:51:45,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:51:45,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:51:45,134 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/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_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 [2022-11-20 10:51:45,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:51:45,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:51:45,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:51:45,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:51:45,688 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:51:45,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-20 10:51:49,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:51:49,508 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:51:49,508 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-20 10:51:49,516 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data/b0ed3079b/9648197ec895498788d0c1b4bf33f0ee/FLAGbc2e62409 [2022-11-20 10:51:49,535 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/data/b0ed3079b/9648197ec895498788d0c1b4bf33f0ee [2022-11-20 10:51:49,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:51:49,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:51:49,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:51:49,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:51:49,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:51:49,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7278ff19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49, skipping insertion in model container [2022-11-20 10:51:49,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:51:49,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:51:49,752 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_5e770280-c615-4568-9a70-a6bd191d9a2a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-20 10:51:49,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:51:49,808 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:51:49,828 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_5e770280-c615-4568-9a70-a6bd191d9a2a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-20 10:51:49,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:51:49,890 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:51:49,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49 WrapperNode [2022-11-20 10:51:49,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:51:49,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:51:49,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:51:49,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:51:49,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,964 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-11-20 10:51:49,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:51:49,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:51:49,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:51:49,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:51:49,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:49,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:50,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:50,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:50,021 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:50,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:50,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:51:50,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:51:50,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:51:50,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:51:50,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (1/1) ... [2022-11-20 10:51:50,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:50,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:51:50,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:51:50,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:51:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:51:50,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:51:50,280 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:51:50,283 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:51:50,606 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:51:50,615 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:51:50,615 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:51:50,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:50 BoogieIcfgContainer [2022-11-20 10:51:50,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:51:50,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:51:50,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:51:50,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:51:50,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:51:49" (1/3) ... [2022-11-20 10:51:50,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251690a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:51:50, skipping insertion in model container [2022-11-20 10:51:50,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:49" (2/3) ... [2022-11-20 10:51:50,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251690a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:51:50, skipping insertion in model container [2022-11-20 10:51:50,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:50" (3/3) ... [2022-11-20 10:51:50,646 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2022-11-20 10:51:50,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:51:50,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:51:50,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:51:50,782 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;@3081327c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:51:50,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:51:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:51:50,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:50,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:50,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:50,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1809708109, now seen corresponding path program 1 times [2022-11-20 10:51:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:51:50,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814964353] [2022-11-20 10:51:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:50,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:50,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:51:50,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:51:50,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 10:51:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:50,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:51:50,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:50,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:51:50,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:51:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814964353] [2022-11-20 10:51:50,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814964353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:50,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:50,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:51:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731346270] [2022-11-20 10:51:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:50,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:51:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:51:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:51:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:51:51,000 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:51:51,017 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-11-20 10:51:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:51:51,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:51:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:51:51,030 INFO L225 Difference]: With dead ends: 20 [2022-11-20 10:51:51,030 INFO L226 Difference]: Without dead ends: 9 [2022-11-20 10:51:51,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-20 10:51:51,038 INFO L413 NwaCegarLoop]: 9 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, 9 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-20 10:51:51,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:51:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-20 10:51:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-20 10:51:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-20 10:51:51,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-11-20 10:51:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:51:51,075 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-20 10:51:51,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-20 10:51:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:51:51,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:51,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:51,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:51:51,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:51,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767691, now seen corresponding path program 1 times [2022-11-20 10:51:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:51:51,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972094768] [2022-11-20 10:51:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:51,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:51,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:51:51,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:51:51,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 10:51:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:51,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:51:51,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:51,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:51:51,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:51:51,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972094768] [2022-11-20 10:51:51,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972094768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:51,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:51,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:51:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832164370] [2022-11-20 10:51:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:51,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:51:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:51:51,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:51:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:51:51,573 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:51:51,632 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-20 10:51:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:51:51,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:51:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:51:51,634 INFO L225 Difference]: With dead ends: 19 [2022-11-20 10:51:51,634 INFO L226 Difference]: Without dead ends: 17 [2022-11-20 10:51:51,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:51:51,637 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:51:51,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:51:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-20 10:51:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2022-11-20 10:51:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-20 10:51:51,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-11-20 10:51:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:51:51,645 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-20 10:51:51,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-20 10:51:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:51:51,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:51,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:51,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:51:51,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:51,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1841040349, now seen corresponding path program 1 times [2022-11-20 10:51:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:51:51,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700894966] [2022-11-20 10:51:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:51:51,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:51:51,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 10:51:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:52,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:51:52,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:52,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:51:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:52,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:51:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700894966] [2022-11-20 10:51:52,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700894966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:51:52,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:51:52,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-20 10:51:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132545384] [2022-11-20 10:51:52,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:51:52,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:51:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:51:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:51:52,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:51:52,789 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:51:52,922 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-11-20 10:51:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:51:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 10:51:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:51:52,926 INFO L225 Difference]: With dead ends: 24 [2022-11-20 10:51:52,926 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 10:51:52,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:51:52,931 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:51:52,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 14 Unchecked, 0.1s Time] [2022-11-20 10:51:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 10:51:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-11-20 10:51:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-20 10:51:52,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2022-11-20 10:51:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:51:52,952 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-20 10:51:52,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-20 10:51:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:51:52,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:52,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-20 10:51:52,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:51:53,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:53,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash 191466507, now seen corresponding path program 2 times [2022-11-20 10:51:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:51:53,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142057073] [2022-11-20 10:51:53,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:51:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:51:53,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:51:53,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 10:51:53,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:51:53,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:51:53,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 10:51:53,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:53,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:51:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:54,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:51:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142057073] [2022-11-20 10:51:54,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142057073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:51:54,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:51:54,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-20 10:51:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128640092] [2022-11-20 10:51:54,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:51:54,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:51:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:51:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:51:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:51:54,516 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:51:54,702 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-11-20 10:51:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:51:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:51:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:51:54,706 INFO L225 Difference]: With dead ends: 29 [2022-11-20 10:51:54,706 INFO L226 Difference]: Without dead ends: 27 [2022-11-20 10:51:54,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:51:54,709 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:51:54,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 40 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-11-20 10:51:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-20 10:51:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-20 10:51:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-11-20 10:51:54,720 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2022-11-20 10:51:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:51:54,721 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-11-20 10:51:54,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-11-20 10:51:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:51:54,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:51:54,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 10:51:54,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:51:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:54,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:51:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1190222557, now seen corresponding path program 3 times [2022-11-20 10:51:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:51:54,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846230612] [2022-11-20 10:51:54,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:51:54,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:51:54,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:51:54,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:51:54,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 10:51:55,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 10:51:55,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:51:55,051 WARN L261 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-20 10:51:55,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:57,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:05,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:52:05,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846230612] [2022-11-20 10:52:05,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846230612] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:05,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:52:05,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-20 10:52:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232939121] [2022-11-20 10:52:05,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:05,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:52:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:52:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:52:05,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:52:05,153 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:05,840 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-11-20 10:52:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:52:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:52:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:05,842 INFO L225 Difference]: With dead ends: 30 [2022-11-20 10:52:05,842 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 10:52:05,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:52:05,843 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:05,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-11-20 10:52:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 10:52:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-20 10:52:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-11-20 10:52:05,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2022-11-20 10:52:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:05,853 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-11-20 10:52:05,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-11-20 10:52:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:52:05,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:05,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-11-20 10:52:05,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:06,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:52:06,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:52:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1666876661, now seen corresponding path program 4 times [2022-11-20 10:52:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:52:06,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79045250] [2022-11-20 10:52:06,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:52:06,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:52:06,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:52:06,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:52:06,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 10:52:06,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:52:06,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:06,201 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-20 10:52:06,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:16,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:50,799 WARN L233 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 622 DAG size of output: 570 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:53:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:53:04,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:53:04,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79045250] [2022-11-20 10:53:04,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79045250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:04,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:53:04,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-20 10:53:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906509980] [2022-11-20 10:53:04,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:04,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 10:53:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:53:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 10:53:04,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-11-20 10:53:04,162 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:04,985 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-11-20 10:53:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:53:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 10:53:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:04,987 INFO L225 Difference]: With dead ends: 35 [2022-11-20 10:53:04,988 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 10:53:04,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2022-11-20 10:53:04,989 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:04,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-11-20 10:53:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 10:53:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-20 10:53:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-11-20 10:53:05,000 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2022-11-20 10:53:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:05,001 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-11-20 10:53:05,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-11-20 10:53:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 10:53:05,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:05,003 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2022-11-20 10:53:05,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:05,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:53:05,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1963977181, now seen corresponding path program 5 times [2022-11-20 10:53:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:53:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264778649] [2022-11-20 10:53:05,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:53:05,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:53:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:53:05,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:53:05,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 10:53:05,382 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-20 10:53:05,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:53:05,391 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 170 conjunts are in the unsatisfiable core [2022-11-20 10:53:05,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:53:17,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:33,558 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 376 DAG size of output: 350 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:54:05,253 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 686 DAG size of output: 560 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:54:24,780 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 558 DAG size of output: 558 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:54:37,232 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 576 DAG size of output: 565 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:55:18,023 WARN L233 SmtUtils]: Spent 17.52s on a formula simplification. DAG size of input: 1102 DAG size of output: 988 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:56:01,739 WARN L233 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 986 DAG size of output: 986 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:56:28,031 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 1004 DAG size of output: 993 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:56:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:28,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:56:28,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264778649] [2022-11-20 10:56:28,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264778649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:56:28,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:56:28,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2022-11-20 10:56:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140883586] [2022-11-20 10:56:28,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:28,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 10:56:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:56:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 10:56:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2022-11-20 10:56:28,103 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:29,185 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-11-20 10:56:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:56:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 10:56:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:29,187 INFO L225 Difference]: With dead ends: 40 [2022-11-20 10:56:29,187 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 10:56:29,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=468, Invalid=1338, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 10:56:29,189 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:29,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-11-20 10:56:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 10:56:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-20 10:56:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-11-20 10:56:29,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2022-11-20 10:56:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:29,202 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-11-20 10:56:29,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-11-20 10:56:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:56:29,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:29,204 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2022-11-20 10:56:29,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:29,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:29,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:29,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1560106485, now seen corresponding path program 6 times [2022-11-20 10:56:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:56:29,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004607857] [2022-11-20 10:56:29,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:56:29,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:29,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:56:29,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:56:29,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 10:56:29,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-20 10:56:29,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 10:56:29,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:56:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:29,748 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 10:56:29,748 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:56:29,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:56:29,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:56:29,970 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2022-11-20 10:56:29,974 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:56:30,046 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,047 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,047 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,047 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,047 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,047 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,047 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:56:30 BoogieIcfgContainer [2022-11-20 10:56:30,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:56:30,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:56:30,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:56:30,079 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:56:30,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:50" (3/4) ... [2022-11-20 10:56:30,081 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:56:30,105 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,113 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,114 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-20 10:56:30,181 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:56:30,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:56:30,182 INFO L158 Benchmark]: Toolchain (without parser) took 280642.40ms. Allocated memory was 77.6MB in the beginning and 664.8MB in the end (delta: 587.2MB). Free memory was 53.4MB in the beginning and 491.8MB in the end (delta: -438.4MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2022-11-20 10:56:30,182 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 77.6MB. Free memory was 55.3MB in the beginning and 55.2MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:30,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.20ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 42.4MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:56:30,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.04ms. Allocated memory is still 77.6MB. Free memory was 42.4MB in the beginning and 40.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:30,183 INFO L158 Benchmark]: Boogie Preprocessor took 61.60ms. Allocated memory is still 77.6MB. Free memory was 40.5MB in the beginning and 39.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:30,184 INFO L158 Benchmark]: RCFGBuilder took 588.74ms. Allocated memory is still 77.6MB. Free memory was 39.1MB in the beginning and 50.6MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:56:30,184 INFO L158 Benchmark]: TraceAbstraction took 279458.07ms. Allocated memory was 77.6MB in the beginning and 664.8MB in the end (delta: 587.2MB). Free memory was 49.9MB in the beginning and 501.2MB in the end (delta: -451.4MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. [2022-11-20 10:56:30,184 INFO L158 Benchmark]: Witness Printer took 102.91ms. Allocated memory is still 664.8MB. Free memory was 501.2MB in the beginning and 491.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:56:30,186 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.39ms. Allocated memory is still 77.6MB. Free memory was 55.3MB in the beginning and 55.2MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.20ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 42.4MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.04ms. Allocated memory is still 77.6MB. Free memory was 42.4MB in the beginning and 40.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.60ms. Allocated memory is still 77.6MB. Free memory was 40.5MB in the beginning and 39.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 588.74ms. Allocated memory is still 77.6MB. Free memory was 39.1MB in the beginning and 50.6MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 279458.07ms. Allocated memory was 77.6MB in the beginning and 664.8MB in the end (delta: 587.2MB). Free memory was 49.9MB in the beginning and 501.2MB in the end (delta: -451.4MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. * Witness Printer took 102.91ms. Allocated memory is still 664.8MB. Free memory was 501.2MB in the beginning and 491.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L32] const SORT_2 var_5 = 0; [L33] const SORT_2 var_10 = 1; [L34] const SORT_2 var_17 = mask_SORT_2; [L36] SORT_1 input_3; [L37] SORT_1 input_4; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_8_arg_1 = var_5; [L43] state_6 = init_8_arg_1 [L44] SORT_2 init_9_arg_1 = var_5; [L45] state_7 = init_9_arg_1 VAL [init_8_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=0, next_16_arg_1=1, state_6=0, state_7=1, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=1, var_13=0, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=1, next_16_arg_1=1, state_6=1, state_7=1, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=1, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=0, var_14_arg_1=2, var_14_arg_2=1, var_17=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=2, next_16_arg_1=1, state_6=2, state_7=1, var_10=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=2, var_13_arg_0=1, var_13_arg_1=2, var_13_arg_2=1, var_14=1, var_14_arg_0=0, var_14_arg_1=2, var_14_arg_2=1, var_17=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=2, next_16_arg_1=2, state_6=2, state_7=2, var_10=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=2, var_13_arg_0=0, var_13_arg_1=3, var_13_arg_2=2, var_14=2, var_14_arg_0=1, var_14_arg_1=2, var_14_arg_2=1, var_17=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=2, state_6=3, state_7=2, var_10=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=2, var_12_arg_1=1, var_13=3, var_13_arg_0=1, var_13_arg_1=3, var_13_arg_2=2, var_14=2, var_14_arg_0=0, var_14_arg_1=3, var_14_arg_2=2, var_17=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=2, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=1, var_11=4, var_11_arg_0=3, var_11_arg_1=1, var_12=3, var_12_arg_0=2, var_12_arg_1=1, var_13=3, var_13_arg_0=0, var_13_arg_1=4, var_13_arg_2=3, var_14=3, var_14_arg_0=1, var_14_arg_1=3, var_14_arg_2=2, var_17=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=2, var_19_arg_1=3, var_20=0, var_20_arg_0=1, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 279.2s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 146 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 41 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 112.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=7, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 273.0s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 222 ConstructedInterpolants, 127 QuantifiedInterpolants, 198774 SizeOfPredicates, 426 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 445 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/320 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-20 10:56:30,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e770280-c615-4568-9a70-a6bd191d9a2a/bin/uautomizer-ug76WZFUDN/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