./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8 --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 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 --- 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-e04fb08 [2022-11-16 12:39:35,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:39:35,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:39:35,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:39:35,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:39:35,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:39:35,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:39:35,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:39:35,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:39:35,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:39:35,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:39:35,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:39:35,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:39:35,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:39:35,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:39:35,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:39:35,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:39:35,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:39:35,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:39:35,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:39:35,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:39:35,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:39:35,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:39:35,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:39:35,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:39:35,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:39:35,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:39:35,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:39:35,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:39:35,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:39:35,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:39:35,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:39:35,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:39:35,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:39:35,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:39:35,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:39:35,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:39:35,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:39:35,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:39:35,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:39:35,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:39:35,655 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:39:35,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:39:35,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:39:35,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:39:35,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:39:35,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:39:35,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:39:35,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:39:35,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:39:35,721 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:39:35,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:39:35,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:39:35,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:39:35,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:39:35,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:39:35,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:39:35,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:39:35,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:39:35,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:39:35,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:39:35,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:39:35,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:39:35,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:35,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:39:35,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:39:35,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:39:35,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:39:35,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:39:35,728 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:39:35,728 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:39:35,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:39:35,735 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8 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 -> 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 [2022-11-16 12:39:36,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:39:36,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:39:36,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:39:36,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:39:36,132 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:39:36,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-11-16 12:39:36,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/80ad30af9/371dfdb19aa847368c3c613063eca07a/FLAG6fccdd7f7 [2022-11-16 12:39:36,776 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:39:36,776 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-11-16 12:39:36,792 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/80ad30af9/371dfdb19aa847368c3c613063eca07a/FLAG6fccdd7f7 [2022-11-16 12:39:37,134 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/80ad30af9/371dfdb19aa847368c3c613063eca07a [2022-11-16 12:39:37,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:39:37,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:39:37,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:37,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:39:37,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:39:37,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dcde23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37, skipping insertion in model container [2022-11-16 12:39:37,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:39:37,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:39:37,393 WARN L229 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-11-16 12:39:37,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:37,444 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:39:37,462 WARN L229 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-11-16 12:39:37,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:37,505 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:39:37,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37 WrapperNode [2022-11-16 12:39:37,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:37,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:37,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:39:37,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:39:37,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,558 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 138 [2022-11-16 12:39:37,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:37,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:39:37,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:39:37,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:39:37,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:39:37,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:39:37,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:39:37,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:39:37,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (1/1) ... [2022-11-16 12:39:37,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:37,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:39:37,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:39:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:39:37,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:39:37,779 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:39:37,781 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:39:38,138 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:39:38,146 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:39:38,157 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:39:38,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:38 BoogieIcfgContainer [2022-11-16 12:39:38,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:39:38,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:39:38,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:39:38,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:39:38,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:37" (1/3) ... [2022-11-16 12:39:38,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352f8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:38, skipping insertion in model container [2022-11-16 12:39:38,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:37" (2/3) ... [2022-11-16 12:39:38,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352f8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:38, skipping insertion in model container [2022-11-16 12:39:38,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:38" (3/3) ... [2022-11-16 12:39:38,169 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2022-11-16 12:39:38,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:39:38,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:39:38,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:39:38,249 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;@712fd0db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:39:38,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:39:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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-16 12:39:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:39:38,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:38,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:38,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:38,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:38,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1809713074, now seen corresponding path program 1 times [2022-11-16 12:39:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:38,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651574063] [2022-11-16 12:39:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,778 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-16 12:39:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:38,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651574063] [2022-11-16 12:39:38,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651574063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:38,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:38,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:39:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714443603] [2022-11-16 12:39:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:39:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:39:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:39:38,842 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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 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-16 12:39:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:38,970 INFO L93 Difference]: Finished difference Result 76 states and 122 transitions. [2022-11-16 12:39:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:38,977 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-16 12:39:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:38,989 INFO L225 Difference]: With dead ends: 76 [2022-11-16 12:39:38,989 INFO L226 Difference]: Without dead ends: 49 [2022-11-16 12:39:38,996 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-16 12:39:39,002 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:39,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:39:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-16 12:39:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-11-16 12:39:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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-16 12:39:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-11-16 12:39:39,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 7 [2022-11-16 12:39:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:39,082 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2022-11-16 12:39:39,083 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-16 12:39:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2022-11-16 12:39:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:39:39,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:39,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:39,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:39:39,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash 268255406, now seen corresponding path program 1 times [2022-11-16 12:39:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:39,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825384822] [2022-11-16 12:39:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:39:39,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:39:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:39:39,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:39:39,225 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:39:39,227 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:39:39,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:39:39,234 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-16 12:39:39,239 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:39:39,261 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:39:39,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:39:39 BoogieIcfgContainer [2022-11-16 12:39:39,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:39:39,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:39:39,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:39:39,272 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:39:39,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:38" (3/4) ... [2022-11-16 12:39:39,277 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:39:39,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:39:39,278 INFO L158 Benchmark]: Toolchain (without parser) took 2139.34ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 83.5MB in the beginning and 91.5MB in the end (delta: -8.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:39,279 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 104.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:39:39,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.51ms. Allocated memory is still 104.9MB. Free memory was 83.2MB in the beginning and 78.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:39:39,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.94ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 76.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:39,281 INFO L158 Benchmark]: Boogie Preprocessor took 30.73ms. Allocated memory is still 104.9MB. Free memory was 76.6MB in the beginning and 75.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:39,282 INFO L158 Benchmark]: RCFGBuilder took 569.41ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 60.7MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:39:39,283 INFO L158 Benchmark]: TraceAbstraction took 1108.97ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 59.9MB in the beginning and 92.3MB in the end (delta: -32.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:39:39,284 INFO L158 Benchmark]: Witness Printer took 6.03ms. Allocated memory is still 125.8MB. Free memory was 92.3MB in the beginning and 91.5MB in the end (delta: 789.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:39:39,287 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.37ms. Allocated memory is still 104.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.51ms. Allocated memory is still 104.9MB. Free memory was 83.2MB in the beginning and 78.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.94ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 76.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.73ms. Allocated memory is still 104.9MB. Free memory was 76.6MB in the beginning and 75.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.41ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 60.7MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1108.97ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 59.9MB in the beginning and 92.3MB in the end (delta: -32.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.03ms. Allocated memory is still 125.8MB. Free memory was 92.3MB in the beginning and 91.5MB in the end (delta: 789.0kB). 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: 20]: 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 65, overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L31] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L32] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L34] const SORT_4 var_5 = 0; [L35] const SORT_1 var_13 = 1; [L36] const SORT_1 var_17 = 0; [L37] const SORT_23 var_25 = 1; [L39] SORT_1 input_2; [L40] SORT_1 input_3; [L42] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_9_arg_1 = var_5; [L50] state_8 = init_9_arg_1 [L51] SORT_1 init_19_arg_1 = var_17; [L52] state_18 = init_19_arg_1 [L53] SORT_1 init_21_arg_1 = var_17; [L54] state_20 = init_21_arg_1 VAL [init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_17=0, var_25=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; VAL [init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=2, input_3=1, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, state_18=0, state_20=0, state_6=0, state_8=0, var_10=1, var_10_arg_0=0, var_10_arg_1=0, var_13=1, var_14=255, var_14_arg_0=1, var_15=1, var_15_arg_0=1, var_15_arg_1=255, var_17=0, var_25=1, var_5=0] [L69] var_15 = var_15 & mask_SORT_1 VAL [init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=2, input_3=1, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, state_18=0, state_20=0, state_6=0, state_8=0, var_10=1, var_10_arg_0=0, var_10_arg_1=0, var_13=1, var_14=255, var_14_arg_0=1, var_15=1, var_15_arg_0=1, var_15_arg_1=255, var_17=0, var_25=1, var_5=0] [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 40 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 1 MinimizatonAttempts, 22 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-16 12:39:39,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8 --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 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 --- 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-e04fb08 [2022-11-16 12:39:41,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:39:41,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:39:42,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:39:42,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:39:42,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:39:42,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:39:42,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:39:42,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:39:42,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:39:42,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:39:42,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:39:42,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:39:42,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:39:42,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:39:42,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:39:42,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:39:42,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:39:42,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:39:42,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:39:42,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:39:42,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:39:42,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:39:42,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:39:42,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:39:42,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:39:42,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:39:42,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:39:42,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:39:42,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:39:42,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:39:42,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:39:42,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:39:42,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:39:42,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:39:42,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:39:42,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:39:42,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:39:42,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:39:42,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:39:42,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:39:42,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 12:39:42,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:39:42,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:39:42,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:39:42,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:39:42,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:39:42,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:39:42,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:39:42,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:39:42,128 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:39:42,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:39:42,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:39:42,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:39:42,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:39:42,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:39:42,131 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:39:42,131 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:39:42,132 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:39:42,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:39:42,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:39:42,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:39:42,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:39:42,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:39:42,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:39:42,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:42,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:39:42,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:39:42,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:39:42,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:39:42,135 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:39:42,136 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:39:42,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:39:42,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:39:42,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:39:42,137 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8 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 -> 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 [2022-11-16 12:39:42,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:39:42,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:39:42,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:39:42,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:39:42,642 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:39:42,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-11-16 12:39:42,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/cbf8433ef/b28851c9d407451a83c313638de69206/FLAG9b68af1e3 [2022-11-16 12:39:43,382 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:39:43,383 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-11-16 12:39:43,393 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/cbf8433ef/b28851c9d407451a83c313638de69206/FLAG9b68af1e3 [2022-11-16 12:39:43,720 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/data/cbf8433ef/b28851c9d407451a83c313638de69206 [2022-11-16 12:39:43,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:39:43,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:39:43,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:43,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:39:43,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:39:43,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:43" (1/1) ... [2022-11-16 12:39:43,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a779df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:43, skipping insertion in model container [2022-11-16 12:39:43,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:43" (1/1) ... [2022-11-16 12:39:43,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:39:43,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:39:43,946 WARN L229 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-11-16 12:39:44,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:44,036 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:39:44,054 WARN L229 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_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-11-16 12:39:44,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:44,163 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:39:44,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44 WrapperNode [2022-11-16 12:39:44,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:44,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:44,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:39:44,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:39:44,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,238 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2022-11-16 12:39:44,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:44,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:39:44,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:39:44,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:39:44,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,298 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:39:44,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:39:44,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:39:44,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:39:44,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (1/1) ... [2022-11-16 12:39:44,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:44,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:39:44,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:39:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:39:44,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:39:44,541 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:39:44,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:39:44,811 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:39:44,819 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:39:44,820 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:39:44,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:44 BoogieIcfgContainer [2022-11-16 12:39:44,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:39:44,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:39:44,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:39:44,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:39:44,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:43" (1/3) ... [2022-11-16 12:39:44,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce3ad5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:44, skipping insertion in model container [2022-11-16 12:39:44,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:44" (2/3) ... [2022-11-16 12:39:44,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce3ad5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:44, skipping insertion in model container [2022-11-16 12:39:44,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:44" (3/3) ... [2022-11-16 12:39:44,835 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2022-11-16 12:39:44,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:39:44,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:39:44,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:39:44,992 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;@5a00ec08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:39:44,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:39:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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-16 12:39:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:39:45,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:45,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:39:45,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-16 12:39:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:45,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039857816] [2022-11-16 12:39:45,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:45,038 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-16 12:39:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:45,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:45,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:45,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:39:45,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:45,501 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-16 12:39:45,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:45,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:45,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039857816] [2022-11-16 12:39:45,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039857816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:45,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:45,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:39:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007263277] [2022-11-16 12:39:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:45,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:39:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:39:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:39:45,556 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-16 12:39:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:45,620 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-11-16 12:39:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:45,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-11-16 12:39:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:45,633 INFO L225 Difference]: With dead ends: 20 [2022-11-16 12:39:45,634 INFO L226 Difference]: Without dead ends: 11 [2022-11-16 12:39:45,637 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-16 12:39:45,642 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:45,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:39:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-16 12:39:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-11-16 12:39:45,682 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-16 12:39:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-16 12:39:45,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-16 12:39:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:45,686 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-16 12:39:45,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-16 12:39:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-16 12:39:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:39:45,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:45,688 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:45,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:45,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:45,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-11-16 12:39:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:45,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808589543] [2022-11-16 12:39:45,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:45,904 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-16 12:39:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:45,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:45,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:46,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:39:46,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:46,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:47,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:47,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808589543] [2022-11-16 12:39:47,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808589543] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:47,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:47,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 12:39:47,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828480616] [2022-11-16 12:39:47,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:47,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:39:47,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:39:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:39:47,057 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-16 12:39:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:47,135 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-16 12:39:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2022-11-16 12:39:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:47,136 INFO L225 Difference]: With dead ends: 16 [2022-11-16 12:39:47,137 INFO L226 Difference]: Without dead ends: 14 [2022-11-16 12:39:47,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:39:47,139 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-11-16 12:39:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-16 12:39:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-16 12:39:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-16 12:39:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-16 12:39:47,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-11-16 12:39:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:47,146 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-16 12:39:47,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-16 12:39:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-16 12:39:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:39:47,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:47,148 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-16 12:39:47,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-16 12:39:47,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:47,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1020920393, now seen corresponding path program 2 times [2022-11-16 12:39:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:47,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790370982] [2022-11-16 12:39:47,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:39:47,372 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-16 12:39:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:47,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:47,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:47,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:39:47,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:47,494 WARN L261 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 12:39:47,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:48,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:49,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790370982] [2022-11-16 12:39:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790370982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:49,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:49,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-16 12:39:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240571342] [2022-11-16 12:39:49,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:49,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:39:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:39:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:39:49,831 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-16 12:39:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:50,004 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-16 12:39:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:39:50,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2022-11-16 12:39:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:50,005 INFO L225 Difference]: With dead ends: 19 [2022-11-16 12:39:50,005 INFO L226 Difference]: Without dead ends: 17 [2022-11-16 12:39:50,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:39:50,007 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 31 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-11-16 12:39:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-16 12:39:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-11-16 12:39:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-16 12:39:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-16 12:39:50,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2022-11-16 12:39:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:50,014 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-16 12:39:50,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-16 12:39:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-16 12:39:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:39:50,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:50,016 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:39:50,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:50,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:50,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 3 times [2022-11-16 12:39:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070336058] [2022-11-16 12:39:50,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:39:50,232 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-16 12:39:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:50,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:50,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:50,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 12:39:50,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:50,349 WARN L261 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-16 12:39:50,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:50,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:53,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:53,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070336058] [2022-11-16 12:39:53,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070336058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:53,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:53,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-16 12:39:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427385105] [2022-11-16 12:39:53,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:39:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:39:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:39:53,766 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-16 12:39:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:54,627 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-11-16 12:39:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:39:54,629 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2022-11-16 12:39:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:54,630 INFO L225 Difference]: With dead ends: 29 [2022-11-16 12:39:54,630 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 12:39:54,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:39:54,632 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:54,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-11-16 12:39:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 12:39:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-11-16 12:39:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-16 12:39:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-11-16 12:39:54,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2022-11-16 12:39:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:54,646 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-11-16 12:39:54,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-16 12:39:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-11-16 12:39:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:39:54,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:54,647 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2022-11-16 12:39:54,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:54,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1250702327, now seen corresponding path program 4 times [2022-11-16 12:39:54,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:54,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538410921] [2022-11-16 12:39:54,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:39:54,869 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-16 12:39:54,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:54,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:54,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:39:55,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:39:55,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:55,016 WARN L261 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-16 12:39:55,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:55,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:59,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538410921] [2022-11-16 12:39:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538410921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:59,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:59,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 12:39:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380543624] [2022-11-16 12:39:59,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:59,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:39:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:59,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:39:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:39:59,836 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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-16 12:40:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:40:02,241 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-11-16 12:40:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:40:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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-16 12:40:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:40:02,243 INFO L225 Difference]: With dead ends: 39 [2022-11-16 12:40:02,243 INFO L226 Difference]: Without dead ends: 37 [2022-11-16 12:40:02,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:40:02,245 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:40:02,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-11-16 12:40:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-16 12:40:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-16 12:40:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-16 12:40:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-11-16 12:40:02,258 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 17 [2022-11-16 12:40:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:40:02,259 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-11-16 12:40:02,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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-16 12:40:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-11-16 12:40:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:40:02,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:40:02,261 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2022-11-16 12:40:02,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:02,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:02,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:40:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 5 times [2022-11-16 12:40:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:40:02,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071752870] [2022-11-16 12:40:02,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:40:02,483 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-16 12:40:02,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:40:02,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:02,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:02,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-16 12:40:02,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:40:02,747 WARN L261 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 200 conjunts are in the unsatisfiable core [2022-11-16 12:40:02,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:40:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:40:04,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:40:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:40:12,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:40:12,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071752870] [2022-11-16 12:40:12,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071752870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:40:12,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:40:12,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-16 12:40:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281914875] [2022-11-16 12:40:12,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:40:12,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:40:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:40:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:40:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:40:12,582 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-16 12:40:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:40:20,049 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-11-16 12:40:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:40:20,050 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 26 [2022-11-16 12:40:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:40:20,051 INFO L225 Difference]: With dead ends: 54 [2022-11-16 12:40:20,051 INFO L226 Difference]: Without dead ends: 52 [2022-11-16 12:40:20,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=255, Invalid=1077, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 12:40:20,053 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:40:20,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2022-11-16 12:40:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-16 12:40:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-11-16 12:40:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 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-16 12:40:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-11-16 12:40:20,097 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 26 [2022-11-16 12:40:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:40:20,098 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-11-16 12:40:20,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-16 12:40:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-11-16 12:40:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:40:20,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:40:20,101 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2022-11-16 12:40:20,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:20,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:20,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:40:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash 282806601, now seen corresponding path program 6 times [2022-11-16 12:40:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:40:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117131563] [2022-11-16 12:40:20,320 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:40:20,320 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-16 12:40:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:40:20,322 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:20,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:40:20,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-11-16 12:40:20,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:40:20,645 WARN L261 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 278 conjunts are in the unsatisfiable core [2022-11-16 12:40:20,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:40:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:40:22,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:40:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:40:41,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:40:41,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117131563] [2022-11-16 12:40:41,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117131563] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:40:41,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:40:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 12:40:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787379351] [2022-11-16 12:40:41,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:40:41,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:40:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:40:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:40:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:40:41,317 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 states have internal predecessors, (68), 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-16 12:41:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:19,008 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-11-16 12:41:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:41:19,009 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 states have internal predecessors, (68), 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 35 [2022-11-16 12:41:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:19,010 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:41:19,010 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 12:41:19,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=490, Invalid=2162, Unknown=0, NotChecked=0, Total=2652 [2022-11-16 12:41:19,012 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:19,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 54 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 245 Invalid, 0 Unknown, 173 Unchecked, 0.4s Time] [2022-11-16 12:41:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 12:41:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-11-16 12:41:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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-16 12:41:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-11-16 12:41:19,038 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 35 [2022-11-16 12:41:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:19,038 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-11-16 12:41:19,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 states have internal predecessors, (68), 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-16 12:41:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-11-16 12:41:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:41:19,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:19,040 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2022-11-16 12:41:19,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:41:19,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:41:19,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash -779438813, now seen corresponding path program 7 times [2022-11-16 12:41:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:41:19,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223923335] [2022-11-16 12:41:19,245 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:41:19,245 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-16 12:41:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:41:19,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:41:19,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:41:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:41:19,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:41:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:41:20,042 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 12:41:20,043 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:41:20,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:41:20,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:41:20,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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-16 12:41:20,260 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1] [2022-11-16 12:41:20,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:41:20,358 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,359 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,359 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,359 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,359 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,360 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,360 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,360 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,360 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,360 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,360 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,361 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,361 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,361 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,361 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,361 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:41:20 BoogieIcfgContainer [2022-11-16 12:41:20,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:41:20,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:41:20,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:41:20,402 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:41:20,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:44" (3/4) ... [2022-11-16 12:41:20,404 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:41:20,434 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,434 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,434 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,434 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,434 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,435 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,436 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,436 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,436 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,436 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 12:41:20,569 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:41:20,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:41:20,571 INFO L158 Benchmark]: Toolchain (without parser) took 96845.42ms. Allocated memory was 79.7MB in the beginning and 232.8MB in the end (delta: 153.1MB). Free memory was 63.2MB in the beginning and 197.9MB in the end (delta: -134.7MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2022-11-16 12:41:20,571 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 79.7MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:41:20,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.31ms. Allocated memory is still 79.7MB. Free memory was 62.9MB in the beginning and 63.4MB in the end (delta: -494.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:41:20,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.76ms. Allocated memory is still 79.7MB. Free memory was 63.4MB in the beginning and 61.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:41:20,572 INFO L158 Benchmark]: Boogie Preprocessor took 62.33ms. Allocated memory is still 79.7MB. Free memory was 61.6MB in the beginning and 60.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:41:20,572 INFO L158 Benchmark]: RCFGBuilder took 522.56ms. Allocated memory is still 79.7MB. Free memory was 60.1MB in the beginning and 47.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:41:20,573 INFO L158 Benchmark]: TraceAbstraction took 95572.70ms. Allocated memory was 79.7MB in the beginning and 232.8MB in the end (delta: 153.1MB). Free memory was 47.0MB in the beginning and 84.2MB in the end (delta: -37.2MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. [2022-11-16 12:41:20,573 INFO L158 Benchmark]: Witness Printer took 168.82ms. Allocated memory is still 232.8MB. Free memory was 84.2MB in the beginning and 197.9MB in the end (delta: -113.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-11-16 12:41:20,575 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.36ms. Allocated memory is still 79.7MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.31ms. Allocated memory is still 79.7MB. Free memory was 62.9MB in the beginning and 63.4MB in the end (delta: -494.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.76ms. Allocated memory is still 79.7MB. Free memory was 63.4MB in the beginning and 61.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.33ms. Allocated memory is still 79.7MB. Free memory was 61.6MB in the beginning and 60.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.56ms. Allocated memory is still 79.7MB. Free memory was 60.1MB in the beginning and 47.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 95572.70ms. Allocated memory was 79.7MB in the beginning and 232.8MB in the end (delta: 153.1MB). Free memory was 47.0MB in the beginning and 84.2MB in the end (delta: -37.2MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. * Witness Printer took 168.82ms. Allocated memory is still 232.8MB. Free memory was 84.2MB in the beginning and 197.9MB in the end (delta: -113.6MB). Peak memory consumption was 13.2MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L31] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L32] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L34] const SORT_4 var_5 = 0; [L35] const SORT_1 var_13 = 1; [L36] const SORT_1 var_17 = 0; [L37] const SORT_23 var_25 = 1; [L39] SORT_1 input_2; [L40] SORT_1 input_3; [L42] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_9_arg_1 = var_5; [L50] state_8 = init_9_arg_1 [L51] SORT_1 init_19_arg_1 = var_17; [L52] state_18 = init_19_arg_1 [L53] SORT_1 init_21_arg_1 = var_17; [L54] state_20 = init_21_arg_1 VAL [init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_17=0, var_25=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=9, input_3=10, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=0, next_35_arg_1=1, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=0, state_8=1, var_10=1, var_10_arg_0=0, var_10_arg_1=0, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=0, var_24_arg_0=0, var_25=1, var_26=1, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=1, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=0, var_29_arg_0=1, var_29_arg_1=0, var_29_arg_2=1, var_31=0, var_31_arg_0=0, var_32=1, var_32_arg_0=0, var_32_arg_1=1, var_33=1, var_33_arg_0=1, var_34=1, var_34_arg_0=1, var_34_arg_1=1, var_34_arg_2=0, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=11, input_3=12, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=1, next_35_arg_1=1, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=1, state_8=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=0, var_24_arg_0=0, var_25=1, var_26=1, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=1, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_29_arg_2=1, var_31=1, var_31_arg_0=1, var_32=2, var_32_arg_0=1, var_32_arg_1=1, var_33=2, var_33_arg_0=2, var_34=1, var_34_arg_0=0, var_34_arg_1=2, var_34_arg_2=1, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=13, input_3=14, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=1, next_35_arg_1=2, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=1, state_8=2, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=1, var_24_arg_0=1, var_25=1, var_26=2, var_26_arg_0=1, var_26_arg_1=1, var_27=2, var_27_arg_0=2, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=1, var_29_arg_0=1, var_29_arg_1=1, var_29_arg_2=2, var_31=1, var_31_arg_0=1, var_32=2, var_32_arg_0=1, var_32_arg_1=1, var_33=2, var_33_arg_0=2, var_34=2, var_34_arg_0=1, var_34_arg_1=2, var_34_arg_2=1, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=15, input_3=16, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=2, next_35_arg_1=2, next_37_arg_1=0, next_38_arg_1=0, state_18=0, state_20=0, state_6=2, state_8=2, var_10=1, var_10_arg_0=1, var_10_arg_1=2, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=1, var_24_arg_0=1, var_25=1, var_26=2, var_26_arg_0=1, var_26_arg_1=1, var_27=2, var_27_arg_0=2, var_28=0, var_28_arg_0=0, var_28_arg_1=1, var_29=2, var_29_arg_0=0, var_29_arg_1=1, var_29_arg_2=2, var_31=2, var_31_arg_0=2, var_32=3, var_32_arg_0=2, var_32_arg_1=1, var_33=3, var_33_arg_0=3, var_34=2, var_34_arg_0=0, var_34_arg_1=3, var_34_arg_2=2, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=17, input_3=18, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=2, next_35_arg_1=3, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=2, state_8=3, var_10=1, var_10_arg_0=2, var_10_arg_1=2, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=2, var_24_arg_0=2, var_25=1, var_26=3, var_26_arg_0=2, var_26_arg_1=1, var_27=3, var_27_arg_0=3, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=2, var_29_arg_0=1, var_29_arg_1=2, var_29_arg_2=3, var_31=2, var_31_arg_0=2, var_32=3, var_32_arg_0=2, var_32_arg_1=1, var_33=3, var_33_arg_0=3, var_34=3, var_34_arg_0=1, var_34_arg_1=3, var_34_arg_2=2, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=19, input_3=20, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=3, next_35_arg_1=3, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=3, state_8=3, var_10=1, var_10_arg_0=2, var_10_arg_1=3, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=2, var_24_arg_0=2, var_25=1, var_26=3, var_26_arg_0=2, var_26_arg_1=1, var_27=3, var_27_arg_0=3, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=3, var_29_arg_0=0, var_29_arg_1=2, var_29_arg_2=3, var_31=3, var_31_arg_0=3, var_32=4, var_32_arg_0=3, var_32_arg_1=1, var_33=4, var_33_arg_0=4, var_34=3, var_34_arg_0=0, var_34_arg_1=4, var_34_arg_2=3, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=21, input_3=22, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=3, next_35_arg_1=4, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=3, state_8=4, var_10=1, var_10_arg_0=3, var_10_arg_1=3, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=3, var_24_arg_0=3, var_25=1, var_26=4, var_26_arg_0=3, var_26_arg_1=1, var_27=4, var_27_arg_0=4, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=3, var_29_arg_0=1, var_29_arg_1=3, var_29_arg_2=4, var_31=3, var_31_arg_0=3, var_32=4, var_32_arg_0=3, var_32_arg_1=1, var_33=4, var_33_arg_0=4, var_34=4, var_34_arg_0=1, var_34_arg_1=4, var_34_arg_2=3, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=23, input_3=24, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=4, next_35_arg_1=4, next_37_arg_1=0, next_38_arg_1=0, state_18=0, state_20=0, state_6=4, state_8=4, var_10=1, var_10_arg_0=3, var_10_arg_1=4, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=3, var_24_arg_0=3, var_25=1, var_26=4, var_26_arg_0=3, var_26_arg_1=1, var_27=4, var_27_arg_0=4, var_28=0, var_28_arg_0=0, var_28_arg_1=1, var_29=4, var_29_arg_0=0, var_29_arg_1=3, var_29_arg_2=4, var_31=4, var_31_arg_0=4, var_32=5, var_32_arg_0=4, var_32_arg_1=1, var_33=5, var_33_arg_0=5, var_34=4, var_34_arg_0=0, var_34_arg_1=5, var_34_arg_2=4, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=25, input_3=26, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=4, next_35_arg_1=5, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=4, state_8=5, var_10=1, var_10_arg_0=4, var_10_arg_1=4, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=4, var_24_arg_0=4, var_25=1, var_26=5, var_26_arg_0=4, var_26_arg_1=1, var_27=5, var_27_arg_0=5, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=4, var_29_arg_0=1, var_29_arg_1=4, var_29_arg_2=5, var_31=4, var_31_arg_0=4, var_32=5, var_32_arg_0=4, var_32_arg_1=1, var_33=5, var_33_arg_0=5, var_34=5, var_34_arg_0=1, var_34_arg_1=5, var_34_arg_2=4, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=27, input_3=28, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=5, next_35_arg_1=5, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=5, state_8=5, var_10=1, var_10_arg_0=4, var_10_arg_1=5, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=4, var_24_arg_0=4, var_25=1, var_26=5, var_26_arg_0=4, var_26_arg_1=1, var_27=5, var_27_arg_0=5, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=5, var_29_arg_0=0, var_29_arg_1=4, var_29_arg_2=5, var_31=5, var_31_arg_0=5, var_32=6, var_32_arg_0=5, var_32_arg_1=1, var_33=6, var_33_arg_0=6, var_34=5, var_34_arg_0=0, var_34_arg_1=6, var_34_arg_2=5, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=29, input_3=30, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=5, next_35_arg_1=6, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=5, state_8=6, var_10=1, var_10_arg_0=5, var_10_arg_1=5, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=5, var_24_arg_0=5, var_25=1, var_26=6, var_26_arg_0=5, var_26_arg_1=1, var_27=6, var_27_arg_0=6, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=5, var_29_arg_0=1, var_29_arg_1=5, var_29_arg_2=6, var_31=5, var_31_arg_0=5, var_32=6, var_32_arg_0=5, var_32_arg_1=1, var_33=6, var_33_arg_0=6, var_34=6, var_34_arg_0=1, var_34_arg_1=6, var_34_arg_2=5, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=31, input_3=32, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=6, next_35_arg_1=6, next_37_arg_1=0, next_38_arg_1=0, state_18=0, state_20=0, state_6=6, state_8=6, var_10=1, var_10_arg_0=5, var_10_arg_1=6, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=5, var_24_arg_0=5, var_25=1, var_26=6, var_26_arg_0=5, var_26_arg_1=1, var_27=6, var_27_arg_0=6, var_28=0, var_28_arg_0=0, var_28_arg_1=1, var_29=6, var_29_arg_0=0, var_29_arg_1=5, var_29_arg_2=6, var_31=6, var_31_arg_0=6, var_32=7, var_32_arg_0=6, var_32_arg_1=1, var_33=7, var_33_arg_0=7, var_34=6, var_34_arg_0=0, var_34_arg_1=7, var_34_arg_2=6, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=33, input_3=34, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=6, next_35_arg_1=7, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=6, state_8=7, var_10=1, var_10_arg_0=6, var_10_arg_1=6, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=6, var_24_arg_0=6, var_25=1, var_26=7, var_26_arg_0=6, var_26_arg_1=1, var_27=7, var_27_arg_0=7, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=6, var_29_arg_0=1, var_29_arg_1=6, var_29_arg_2=7, var_31=6, var_31_arg_0=6, var_32=7, var_32_arg_0=6, var_32_arg_1=1, var_33=7, var_33_arg_0=7, var_34=7, var_34_arg_0=1, var_34_arg_1=7, var_34_arg_2=6, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=35, input_3=36, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=7, next_35_arg_1=7, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=7, state_8=7, var_10=1, var_10_arg_0=6, var_10_arg_1=7, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=6, var_24_arg_0=6, var_25=1, var_26=7, var_26_arg_0=6, var_26_arg_1=1, var_27=7, var_27_arg_0=7, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=7, var_29_arg_0=0, var_29_arg_1=6, var_29_arg_2=7, var_31=7, var_31_arg_0=7, var_32=8, var_32_arg_0=7, var_32_arg_1=1, var_33=8, var_33_arg_0=8, var_34=7, var_34_arg_0=0, var_34_arg_1=8, var_34_arg_2=7, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=37, input_3=38, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=7, next_35_arg_1=0, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=7, state_8=0, var_10=1, var_10_arg_0=7, var_10_arg_1=7, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=7, var_24_arg_0=7, var_25=1, var_26=8, var_26_arg_0=7, var_26_arg_1=1, var_27=8, var_27_arg_0=8, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=7, var_29_arg_0=1, var_29_arg_1=7, var_29_arg_2=8, var_31=7, var_31_arg_0=7, var_32=8, var_32_arg_0=7, var_32_arg_1=1, var_33=8, var_33_arg_0=8, var_34=0, var_34_arg_0=1, var_34_arg_1=8, var_34_arg_2=7, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.3s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 48.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 407 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 475 IncrementalHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 29 mSDtfsCounter, 475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 75.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=7, InterpolantAutomatonStates: 105, 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, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 214 ConstructedInterpolants, 87 QuantifiedInterpolants, 25114 SizeOfPredicates, 749 NumberOfNonLiveVariables, 1575 ConjunctsInSsa, 808 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/564 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-16 12:41:20,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64c430f5-e82e-4f9c-b593-f573e8d0a9d6/bin/uautomizer-tPACEb0tL8/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