./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- 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-8393723 [2022-11-18 19:55:57,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:55:57,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:55:57,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:55:57,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:55:57,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:55:57,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:55:57,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:55:57,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:55:57,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:55:57,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:55:57,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:55:57,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:55:57,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:55:57,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:55:57,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:55:57,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:55:57,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:55:57,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:55:57,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:55:57,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:55:57,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:55:57,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:55:57,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:55:57,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:55:57,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:55:57,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:55:57,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:55:57,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:55:57,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:55:57,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:55:57,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:55:57,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:55:57,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:55:57,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:55:57,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:55:57,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:55:57,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:55:57,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:55:57,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:55:57,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:55:57,589 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:55:57,651 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:55:57,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:55:57,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:55:57,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:55:57,654 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:55:57,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:55:57,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:55:57,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:55:57,657 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:55:57,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:55:57,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:55:57,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:55:57,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:55:57,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:55:57,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:55:57,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:55:57,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:55:57,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:55:57,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:55:57,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:55:57,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:55:57,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:55:57,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:55:57,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:55:57,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:57,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:55:57,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:55:57,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:55:57,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:55:57,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:55:57,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:55:57,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:55:57,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:55:57,667 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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2022-11-18 19:55:58,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:55:58,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:55:58,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:55:58,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:55:58,094 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:55:58,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/bitvector/num_conversion_1.c [2022-11-18 19:55:58,183 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/d11a8d7d1/9c6e3765679449cea143e9dd7d430440/FLAG1ba1f2e4f [2022-11-18 19:55:58,769 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:55:58,770 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/sv-benchmarks/c/bitvector/num_conversion_1.c [2022-11-18 19:55:58,777 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/d11a8d7d1/9c6e3765679449cea143e9dd7d430440/FLAG1ba1f2e4f [2022-11-18 19:55:59,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/d11a8d7d1/9c6e3765679449cea143e9dd7d430440 [2022-11-18 19:55:59,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:55:59,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:55:59,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:59,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:55:59,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:55:59,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6751b6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59, skipping insertion in model container [2022-11-18 19:55:59,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:55:59,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:55:59,344 WARN L234 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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2022-11-18 19:55:59,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:59,376 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:55:59,396 WARN L234 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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2022-11-18 19:55:59,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:59,436 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:55:59,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59 WrapperNode [2022-11-18 19:55:59,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:59,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:59,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:55:59,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:55:59,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,483 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-11-18 19:55:59,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:59,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:55:59,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:55:59,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:55:59,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,533 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:55:59,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:55:59,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:55:59,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:55:59,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (1/1) ... [2022-11-18 19:55:59,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:59,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:59,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:55:59,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:55:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:55:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:55:59,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:55:59,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:55:59,758 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:55:59,764 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:56:00,022 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:56:00,031 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:56:00,031 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 19:56:00,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:00 BoogieIcfgContainer [2022-11-18 19:56:00,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:56:00,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:56:00,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:56:00,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:56:00,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:55:59" (1/3) ... [2022-11-18 19:56:00,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2869aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:56:00, skipping insertion in model container [2022-11-18 19:56:00,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:59" (2/3) ... [2022-11-18 19:56:00,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2869aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:56:00, skipping insertion in model container [2022-11-18 19:56:00,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:00" (3/3) ... [2022-11-18 19:56:00,065 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2022-11-18 19:56:00,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:56:00,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:56:00,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:56:00,255 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;@3722e67e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:56:00,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:56:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 19:56:00,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:00,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 19:56:00,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-18 19:56:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:00,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955392970] [2022-11-18 19:56:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:00,556 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-18 19:56:00,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:00,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955392970] [2022-11-18 19:56:00,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955392970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:00,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:00,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779089031] [2022-11-18 19:56:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:00,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:56:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:56:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:00,622 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 19:56:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:00,640 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-18 19:56:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:56:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-18 19:56:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:00,656 INFO L225 Difference]: With dead ends: 21 [2022-11-18 19:56:00,657 INFO L226 Difference]: Without dead ends: 9 [2022-11-18 19:56:00,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:00,671 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:00,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-18 19:56:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-18 19:56:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-18 19:56:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-18 19:56:00,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-18 19:56:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:00,742 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-18 19:56:00,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 19:56:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-18 19:56:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 19:56:00,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:00,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 19:56:00,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:56:00,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-18 19:56:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:00,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95620658] [2022-11-18 19:56:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:00,931 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-18 19:56:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95620658] [2022-11-18 19:56:00,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95620658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:00,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:00,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492702893] [2022-11-18 19:56:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:00,940 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 19:56:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:00,994 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-11-18 19:56:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:00,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-18 19:56:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:00,996 INFO L225 Difference]: With dead ends: 16 [2022-11-18 19:56:00,996 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 19:56:00,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:00,999 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:01,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 19:56:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2022-11-18 19:56:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-18 19:56:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-18 19:56:01,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-11-18 19:56:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:01,005 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-18 19:56:01,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 19:56:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-18 19:56:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:56:01,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:01,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:01,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:56:01,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-18 19:56:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:01,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57756470] [2022-11-18 19:56:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57756470] [2022-11-18 19:56:01,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57756470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:56:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483747181] [2022-11-18 19:56:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:01,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:01,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:01,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:56:01,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:56:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:01,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:56:01,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:01,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:01,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483747181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:01,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:56:01,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2022-11-18 19:56:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796978595] [2022-11-18 19:56:01,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:01,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:56:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:01,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:56:01,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:56:01,497 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:01,569 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-11-18 19:56:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:56:01,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 19:56:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:01,571 INFO L225 Difference]: With dead ends: 23 [2022-11-18 19:56:01,571 INFO L226 Difference]: Without dead ends: 19 [2022-11-18 19:56:01,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:56:01,574 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:01,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-18 19:56:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-18 19:56:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-18 19:56:01,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-11-18 19:56:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:01,582 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-18 19:56:01,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-18 19:56:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:56:01,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:01,599 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:01,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 19:56:01,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:01,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-18 19:56:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193865059] [2022-11-18 19:56:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:02,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193865059] [2022-11-18 19:56:02,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193865059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:56:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340375823] [2022-11-18 19:56:02,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:56:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:02,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:56:02,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:56:02,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:56:02,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:02,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 19:56:02,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:02,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:02,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340375823] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:02,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:56:02,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2022-11-18 19:56:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023968111] [2022-11-18 19:56:02,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:02,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:56:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:56:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:56:02,863 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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-18 19:56:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:03,446 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-11-18 19:56:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:56:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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) Word has length 18 [2022-11-18 19:56:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:03,448 INFO L225 Difference]: With dead ends: 41 [2022-11-18 19:56:03,448 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 19:56:03,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2022-11-18 19:56:03,451 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:03,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 96 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 19:56:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-18 19:56:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 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-18 19:56:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-11-18 19:56:03,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 18 [2022-11-18 19:56:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:03,473 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-11-18 19:56:03,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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-18 19:56:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-11-18 19:56:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 19:56:03,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:03,477 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:03,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:03,687 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2022-11-18 19:56:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:03,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345024119] [2022-11-18 19:56:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:56:03,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:56:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:56:03,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:56:03,841 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:56:03,847 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 19:56:03,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:56:03,858 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-11-18 19:56:03,863 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:56:03,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:56:03 BoogieIcfgContainer [2022-11-18 19:56:03,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:56:03,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:56:03,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:56:03,921 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:56:03,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:00" (3/4) ... [2022-11-18 19:56:03,926 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:56:03,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:56:03,927 INFO L158 Benchmark]: Toolchain (without parser) took 4811.98ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 76.1MB in the beginning and 74.8MB in the end (delta: 1.4MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-11-18 19:56:03,927 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:03,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.82ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 76.0MB in the beginning and 114.8MB in the end (delta: -38.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 19:56:03,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 138.4MB. Free memory was 114.8MB in the beginning and 113.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:03,929 INFO L158 Benchmark]: Boogie Preprocessor took 51.91ms. Allocated memory is still 138.4MB. Free memory was 113.2MB in the beginning and 112.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:03,930 INFO L158 Benchmark]: RCFGBuilder took 502.03ms. Allocated memory is still 138.4MB. Free memory was 112.1MB in the beginning and 102.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:56:03,930 INFO L158 Benchmark]: TraceAbstraction took 3868.67ms. Allocated memory is still 138.4MB. Free memory was 102.2MB in the beginning and 74.8MB in the end (delta: 27.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:03,930 INFO L158 Benchmark]: Witness Printer took 14.25ms. Allocated memory is still 138.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:03,933 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.34ms. Allocated memory is still 104.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.82ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 76.0MB in the beginning and 114.8MB in the end (delta: -38.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 138.4MB. Free memory was 114.8MB in the beginning and 113.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.91ms. Allocated memory is still 138.4MB. Free memory was 113.2MB in the beginning and 112.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 502.03ms. Allocated memory is still 138.4MB. Free memory was 112.1MB in the beginning and 102.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3868.67ms. Allocated memory is still 138.4MB. Free memory was 102.2MB in the beginning and 74.8MB in the end (delta: 27.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 14.25ms. Allocated memory is still 138.4MB. Free memory is still 74.8MB. 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: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=0, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=0, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=1, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=1, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=1, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=2, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=2, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=2, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=3, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=3, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=3, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=4, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=4, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=4, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=5, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=5, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=5, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=6, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=6, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=6, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=7, i=1, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=7, i=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=7, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=8, i=1, x=37, y=0] [L31] COND FALSE !(c < (unsigned char)8) VAL [bit=0, c=8, i=1, x=37, y=0] [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 47 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 5 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/69 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-18 19:56:03,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- 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-8393723 [2022-11-18 19:56:06,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:56:06,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:56:06,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:56:06,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:56:06,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:56:06,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:56:06,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:56:06,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:56:06,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:56:06,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:56:06,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:56:06,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:56:06,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:56:06,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:56:06,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:56:06,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:56:06,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:56:06,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:56:06,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:56:06,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:56:06,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:56:06,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:56:06,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:56:06,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:56:06,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:56:06,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:56:06,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:56:06,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:56:06,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:56:06,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:56:06,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:56:06,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:56:06,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:56:06,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:56:06,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:56:06,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:56:06,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:56:06,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:56:06,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:56:06,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:56:06,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 19:56:06,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:56:06,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:56:06,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:56:06,837 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:56:06,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:56:06,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:56:06,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:56:06,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:56:06,840 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:56:06,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:56:06,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:56:06,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:56:06,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:56:06,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:56:06,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:56:06,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:56:06,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:56:06,843 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 19:56:06,843 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 19:56:06,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:56:06,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:56:06,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:56:06,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:56:06,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:56:06,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:56:06,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:56:06,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:56:06,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:56:06,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:56:06,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:56:06,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 19:56:06,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 19:56:06,847 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:56:06,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:56:06,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:56:06,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 19:56:06,848 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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2022-11-18 19:56:07,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:56:07,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:56:07,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:56:07,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:56:07,325 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:56:07,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/bitvector/num_conversion_1.c [2022-11-18 19:56:07,425 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/0cf22e3b7/93ab0bf0c63c4ee6afa451381f2533cd/FLAG497a4bd70 [2022-11-18 19:56:08,033 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:56:08,034 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/sv-benchmarks/c/bitvector/num_conversion_1.c [2022-11-18 19:56:08,043 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/0cf22e3b7/93ab0bf0c63c4ee6afa451381f2533cd/FLAG497a4bd70 [2022-11-18 19:56:08,347 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/data/0cf22e3b7/93ab0bf0c63c4ee6afa451381f2533cd [2022-11-18 19:56:08,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:56:08,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:56:08,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:56:08,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:56:08,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:56:08,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@940bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08, skipping insertion in model container [2022-11-18 19:56:08,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:56:08,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:56:08,561 WARN L234 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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2022-11-18 19:56:08,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:56:08,593 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:56:08,609 WARN L234 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_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2022-11-18 19:56:08,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:56:08,655 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:56:08,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08 WrapperNode [2022-11-18 19:56:08,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:56:08,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:56:08,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:56:08,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:56:08,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,706 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-11-18 19:56:08,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:56:08,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:56:08,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:56:08,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:56:08,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,754 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:56:08,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:56:08,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:56:08,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:56:08,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (1/1) ... [2022-11-18 19:56:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:56:08,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:08,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:56:08,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:56:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:56:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:56:08,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:56:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 19:56:08,968 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:56:08,971 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:56:09,199 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:56:09,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:56:09,207 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 19:56:09,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:09 BoogieIcfgContainer [2022-11-18 19:56:09,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:56:09,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:56:09,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:56:09,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:56:09,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:56:08" (1/3) ... [2022-11-18 19:56:09,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784435f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:56:09, skipping insertion in model container [2022-11-18 19:56:09,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:08" (2/3) ... [2022-11-18 19:56:09,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784435f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:56:09, skipping insertion in model container [2022-11-18 19:56:09,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:09" (3/3) ... [2022-11-18 19:56:09,241 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2022-11-18 19:56:09,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:56:09,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:56:09,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:56:09,399 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;@54776852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:56:09,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:56:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 19:56:09,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:09,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 19:56:09,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:09,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-18 19:56:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:09,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591851256] [2022-11-18 19:56:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:09,471 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-18 19:56:09,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:09,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:09,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:09,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 19:56:09,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:09,630 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-18 19:56:09,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:09,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:09,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591851256] [2022-11-18 19:56:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591851256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:09,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:09,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273516202] [2022-11-18 19:56:09,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:09,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:56:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:56:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:09,702 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 19:56:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:09,725 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-18 19:56:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:56:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-18 19:56:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:09,772 INFO L225 Difference]: With dead ends: 21 [2022-11-18 19:56:09,772 INFO L226 Difference]: Without dead ends: 9 [2022-11-18 19:56:09,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:09,792 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:09,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-18 19:56:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-18 19:56:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-18 19:56:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-18 19:56:09,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-18 19:56:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:09,851 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-18 19:56:09,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 19:56:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-18 19:56:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 19:56:09,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:09,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 19:56:09,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-18 19:56:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385178311] [2022-11-18 19:56:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:10,069 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-18 19:56:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:10,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:10,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 19:56:10,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:10,215 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-18 19:56:10,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:10,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385178311] [2022-11-18 19:56:10,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385178311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:10,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:10,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201615630] [2022-11-18 19:56:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:10,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:10,233 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 19:56:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:10,272 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-11-18 19:56:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-18 19:56:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:10,276 INFO L225 Difference]: With dead ends: 16 [2022-11-18 19:56:10,276 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 19:56:10,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:10,280 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:10,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 19:56:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2022-11-18 19:56:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-18 19:56:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-18 19:56:10,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-11-18 19:56:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:10,289 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-18 19:56:10,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 19:56:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-18 19:56:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:56:10,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:10,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:10,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:10,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-18 19:56:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487367371] [2022-11-18 19:56:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:10,508 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-18 19:56:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:10,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:10,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:56:10,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:10,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:10,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487367371] [2022-11-18 19:56:10,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487367371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:10,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:56:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176840300] [2022-11-18 19:56:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:10,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:10,612 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-18 19:56:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:10,650 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-11-18 19:56:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:56:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Word has length 9 [2022-11-18 19:56:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:10,652 INFO L225 Difference]: With dead ends: 24 [2022-11-18 19:56:10,652 INFO L226 Difference]: Without dead ends: 17 [2022-11-18 19:56:10,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-18 19:56:10,656 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:10,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-18 19:56:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2022-11-18 19:56:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-18 19:56:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-18 19:56:10,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2022-11-18 19:56:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:10,663 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-18 19:56:10,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-18 19:56:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-18 19:56:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:56:10,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:10,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:10,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:10,879 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2022-11-18 19:56:10,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:10,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037640253] [2022-11-18 19:56:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:10,880 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-18 19:56:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:10,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:10,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 19:56:10,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:10,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:11,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:11,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037640253] [2022-11-18 19:56:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037640253] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:11,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:56:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-18 19:56:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081094449] [2022-11-18 19:56:11,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:11,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:56:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:11,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:56:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:56:11,057 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 19:56:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:11,142 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-11-18 19:56:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:56:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 9 [2022-11-18 19:56:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:11,146 INFO L225 Difference]: With dead ends: 23 [2022-11-18 19:56:11,148 INFO L226 Difference]: Without dead ends: 19 [2022-11-18 19:56:11,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:11,154 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:11,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-18 19:56:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-18 19:56:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-18 19:56:11,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2022-11-18 19:56:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:11,180 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-18 19:56:11,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 19:56:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-18 19:56:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:56:11,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:11,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:11,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:11,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2022-11-18 19:56:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:11,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022523833] [2022-11-18 19:56:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:11,399 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-18 19:56:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:11,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:11,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:11,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:56:11,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:56:11,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:56:11,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:11,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022523833] [2022-11-18 19:56:11,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022523833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:11,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:56:11,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-18 19:56:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285145332] [2022-11-18 19:56:11,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:11,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:56:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:56:11,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:56:11,771 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-18 19:56:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:12,158 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-18 19:56:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:56:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 18 [2022-11-18 19:56:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:12,160 INFO L225 Difference]: With dead ends: 56 [2022-11-18 19:56:12,161 INFO L226 Difference]: Without dead ends: 47 [2022-11-18 19:56:12,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:56:12,166 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:12,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-18 19:56:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2022-11-18 19:56:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-18 19:56:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-18 19:56:12,190 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-11-18 19:56:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:12,191 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-18 19:56:12,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-18 19:56:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-18 19:56:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:56:12,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:12,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:12,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:12,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:12,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2022-11-18 19:56:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:12,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390556733] [2022-11-18 19:56:12,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:56:12,410 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-18 19:56:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:12,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:12,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:12,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:56:12,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:12,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:56:12,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:12,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:12,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390556733] [2022-11-18 19:56:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390556733] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:12,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:56:12,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-18 19:56:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342047546] [2022-11-18 19:56:12,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:12,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:56:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:56:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:56:12,773 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-18 19:56:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:12,950 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-11-18 19:56:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:56:12,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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 18 [2022-11-18 19:56:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:12,954 INFO L225 Difference]: With dead ends: 35 [2022-11-18 19:56:12,954 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 19:56:12,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:56:12,960 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:12,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 68 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 19:56:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-18 19:56:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-18 19:56:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-18 19:56:12,985 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2022-11-18 19:56:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:12,985 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-18 19:56:12,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-18 19:56:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-18 19:56:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 19:56:12,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:12,987 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:13,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:13,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:13,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2022-11-18 19:56:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:13,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246341257] [2022-11-18 19:56:13,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:56:13,202 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-18 19:56:13,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:13,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:13,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:13,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-18 19:56:13,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:13,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 19:56:13,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:56:14,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:56:16,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:16,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246341257] [2022-11-18 19:56:16,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246341257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:16,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:56:16,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-11-18 19:56:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539861995] [2022-11-18 19:56:16,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:16,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-18 19:56:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-18 19:56:16,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2022-11-18 19:56:16,687 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 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-18 19:56:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:17,586 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-11-18 19:56:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 19:56:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 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 30 [2022-11-18 19:56:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:17,594 INFO L225 Difference]: With dead ends: 64 [2022-11-18 19:56:17,594 INFO L226 Difference]: Without dead ends: 60 [2022-11-18 19:56:17,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2022-11-18 19:56:17,597 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:17,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 233 Unchecked, 0.1s Time] [2022-11-18 19:56:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-18 19:56:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-11-18 19:56:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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-18 19:56:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-11-18 19:56:17,621 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2022-11-18 19:56:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:17,622 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-11-18 19:56:17,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 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-18 19:56:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-11-18 19:56:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 19:56:17,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:17,625 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:17,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:17,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:17,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2022-11-18 19:56:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:17,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252508834] [2022-11-18 19:56:17,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:56:17,840 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-18 19:56:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:17,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:17,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:17,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:56:17,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:17,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 19:56:17,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:18,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:18,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:18,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252508834] [2022-11-18 19:56:18,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252508834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:18,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:56:18,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-18 19:56:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121291163] [2022-11-18 19:56:18,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:18,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 19:56:18,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 19:56:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:56:18,632 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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-18 19:56:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:19,897 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-11-18 19:56:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 19:56:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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 30 [2022-11-18 19:56:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:19,898 INFO L225 Difference]: With dead ends: 111 [2022-11-18 19:56:19,899 INFO L226 Difference]: Without dead ends: 87 [2022-11-18 19:56:19,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 19:56:19,900 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 232 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:19,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 64 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-18 19:56:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2022-11-18 19:56:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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-18 19:56:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-11-18 19:56:19,916 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2022-11-18 19:56:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:19,916 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-11-18 19:56:19,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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-18 19:56:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-11-18 19:56:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 19:56:19,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:19,918 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:19,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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)] Ended with exit code 0 [2022-11-18 19:56:20,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:20,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:56:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2022-11-18 19:56:20,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:20,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718962900] [2022-11-18 19:56:20,136 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 19:56:20,136 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-18 19:56:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:20,137 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:20,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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 (10)] Waiting until timeout for monitored process [2022-11-18 19:56:20,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-18 19:56:20,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:20,183 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 19:56:20,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 37 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:23,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:28,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718962900] [2022-11-18 19:56:28,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718962900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:28,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:56:28,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-11-18 19:56:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338578719] [2022-11-18 19:56:28,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:28,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 19:56:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:28,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 19:56:28,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2022-11-18 19:56:28,041 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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-18 19:56:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:30,765 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-11-18 19:56:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 19:56:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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 33 [2022-11-18 19:56:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:30,766 INFO L225 Difference]: With dead ends: 56 [2022-11-18 19:56:30,766 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 19:56:30,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=855, Invalid=3435, Unknown=0, NotChecked=0, Total=4290 [2022-11-18 19:56:30,769 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:30,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 13 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-11-18 19:56:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 19:56:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 19:56:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-18 19:56:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 19:56:30,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-11-18 19:56:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:30,772 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 19:56:30,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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-18 19:56:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 19:56:30,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 19:56:30,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 19:56:30,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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 (10)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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-18 19:56:30,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 19:56:32,170 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:56:32,173 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse2 (= (_ bv1 8) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv5 8))) (.cse0 (= |ULTIMATE.start_main_~bit~0#1| (_ bv0 8))) (.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 8)) .cse1 .cse2) (and (= (_ bv1 8) |ULTIMATE.start_main_~c~0#1|) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~bit~0#1|) (_ bv0 32))) .cse1 .cse2) (and (= |ULTIMATE.start_main_~y~0#1| (_ bv0 8)) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 8)) .cse1) (and .cse3 .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse6))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4))) .cse5))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse6))) .cse5))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse7))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7))) .cse5))) (_ bv0 32)) (bvslt .cse7 (_ bv8 32))))))) .cse1) (and .cse3 (= |ULTIMATE.start_main_~c~0#1| (_ bv5 8)) .cse0 .cse1) (and .cse3 (= (_ bv4 8) |ULTIMATE.start_main_~bit~0#1|) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse8))) .cse5))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse8)))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse10))))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse9))) .cse5))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse10))) .cse5))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse11 (_ bv1 32)))) (bvslt .cse11 (_ bv8 32))))))) .cse1) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8)) (|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse16))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse18))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 (_ bv1 32))))))))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32))))) (.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse12))) .cse13))) (_ bv0 32)) (bvslt .cse14 (_ bv8 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) .cse13)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse16))) .cse13))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse14))) .cse13)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse17))) .cse13))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse14 (_ bv1 32)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse18))) .cse13))) (_ bv0 32)))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse19))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))) (bvslt .cse20 (_ bv8 32)))))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse21))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse21 (_ bv1 32))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse25))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse26))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse22))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse23))) .cse5))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))) .cse5)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse25))) .cse5))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse26))) .cse5))) (_ bv0 32)) (bvslt .cse22 (_ bv8 32))))))))) .cse1) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse29))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse31))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32))))))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))) .cse5))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))) .cse5)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29))) .cse5))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse30))) .cse5))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse30 (_ bv1 32)))) (bvslt .cse30 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse31))) .cse5))) (_ bv0 32))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 (_ bv1 32)))) (_ bv1 32))))))) .cse1))) [2022-11-18 19:56:32,173 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2022-11-18 19:56:32,174 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-11-18 19:56:32,174 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2022-11-18 19:56:32,174 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-11-18 19:56:32,174 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2022-11-18 19:56:32,174 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 19:56:32,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 19:56:32,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 19:56:32,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-11-18 19:56:32,175 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-11-18 19:56:32,175 INFO L902 garLoopResultBuilder]: At program point L41(lines 22 42) the Hoare annotation is: true [2022-11-18 19:56:32,179 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2022-11-18 19:56:32,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:56:32,198 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,200 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,200 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,209 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,209 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,211 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,211 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,211 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,212 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,212 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,213 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,213 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,213 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,214 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,236 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,236 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,236 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,240 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,240 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,241 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:56:32 BoogieIcfgContainer [2022-11-18 19:56:32,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:56:32,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:56:32,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:56:32,248 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:56:32,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:09" (3/4) ... [2022-11-18 19:56:32,252 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 19:56:32,263 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-18 19:56:32,263 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-18 19:56:32,264 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 19:56:32,264 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 19:56:32,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && x == 37bv8) && 1bv8 == y)) || ((y == 0bv8 && c == 0bv8) && x == 37bv8)) || (((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((y == 5bv8 && c == 5bv8) && bit == 0bv8) && x == 37bv8)) || ((((y == 5bv8 && 4bv8 == bit) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8, ULTIMATE.start_main_~x~0#1 : bv8 :: ((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0] && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8) [2022-11-18 19:56:32,300 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:56:32,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:56:32,302 INFO L158 Benchmark]: Toolchain (without parser) took 23950.28ms. Allocated memory was 75.5MB in the beginning and 167.8MB in the end (delta: 92.3MB). Free memory was 59.1MB in the beginning and 80.1MB in the end (delta: -21.0MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2022-11-18 19:56:32,302 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 75.5MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:32,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.60ms. Allocated memory is still 75.5MB. Free memory was 58.8MB in the beginning and 60.1MB in the end (delta: -1.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-11-18 19:56:32,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.04ms. Allocated memory is still 75.5MB. Free memory was 60.1MB in the beginning and 58.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:32,303 INFO L158 Benchmark]: Boogie Preprocessor took 52.13ms. Allocated memory is still 75.5MB. Free memory was 58.7MB in the beginning and 57.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:32,304 INFO L158 Benchmark]: RCFGBuilder took 450.10ms. Allocated memory is still 75.5MB. Free memory was 57.4MB in the beginning and 47.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:56:32,304 INFO L158 Benchmark]: TraceAbstraction took 23034.10ms. Allocated memory was 75.5MB in the beginning and 167.8MB in the end (delta: 92.3MB). Free memory was 47.2MB in the beginning and 83.3MB in the end (delta: -36.1MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2022-11-18 19:56:32,305 INFO L158 Benchmark]: Witness Printer took 53.44ms. Allocated memory is still 167.8MB. Free memory was 83.3MB in the beginning and 80.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 19:56:32,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 75.5MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.60ms. Allocated memory is still 75.5MB. Free memory was 58.8MB in the beginning and 60.1MB in the end (delta: -1.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.04ms. Allocated memory is still 75.5MB. Free memory was 60.1MB in the beginning and 58.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.13ms. Allocated memory is still 75.5MB. Free memory was 58.7MB in the beginning and 57.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 450.10ms. Allocated memory is still 75.5MB. Free memory was 57.4MB in the beginning and 47.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23034.10ms. Allocated memory was 75.5MB in the beginning and 167.8MB in the end (delta: 92.3MB). Free memory was 47.2MB in the beginning and 83.3MB in the end (delta: -36.1MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. * Witness Printer took 53.44ms. Allocated memory is still 167.8MB. Free memory was 83.3MB in the beginning and 80.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] * 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 272 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 80 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 118, 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, 9 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 905 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 998 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 282 ConstructedInterpolants, 46 QuantifiedInterpolants, 7387 SizeOfPredicates, 40 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 182/693 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant [2022-11-18 19:56:32,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,339 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,339 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,339 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,340 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,340 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,340 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,341 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,341 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,341 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,342 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,346 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,346 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,346 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,346 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,349 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,349 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-11-18 19:56:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-11-18 19:56:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-11-18 19:56:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] Derived loop invariant: ((((((((((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && x == 37bv8) && 1bv8 == y)) || ((y == 0bv8 && c == 0bv8) && x == 37bv8)) || (((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((y == 5bv8 && c == 5bv8) && bit == 0bv8) && x == 37bv8)) || ((((y == 5bv8 && 4bv8 == bit) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8, ULTIMATE.start_main_~x~0#1 : bv8 :: ((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0] && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-18 19:56:32,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f5a0fb0-57ab-41c6-8501-77b1930b7d95/bin/uautomizer-TMbwUNV5ro/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 Result: TRUE