./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/phases_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/phases_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R --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 bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 --- 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-38b53e6 [2022-11-25 15:46:03,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:46:03,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:46:03,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:46:03,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:46:03,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:46:03,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:46:03,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:46:03,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:46:03,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:46:03,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:46:03,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:46:03,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:46:03,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:46:03,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:46:03,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:46:03,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:46:03,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:46:03,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:46:03,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:46:03,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:46:03,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:46:03,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:46:03,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:46:03,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:46:03,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:46:03,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:46:03,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:46:03,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:46:03,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:46:03,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:46:03,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:46:03,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:46:03,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:46:03,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:46:03,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:46:03,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:46:03,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:46:03,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:46:03,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:46:03,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:46:03,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:46:03,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:46:03,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:46:03,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:46:03,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:46:03,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:46:03,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:46:03,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:46:03,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:46:03,650 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:46:03,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:46:03,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:46:03,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:46:03,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:46:03,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:46:03,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:46:03,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:46:03,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:46:03,652 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:46:03,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:46:03,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:46:03,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:46:03,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:46:03,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:46:03,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:46:03,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:46:03,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:46:03,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:46:03,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:46:03,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:46:03,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:46:03,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:46:03,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:46:03,657 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:46:03,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:46:03,657 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/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_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R 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 -> bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 [2022-11-25 15:46:03,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:46:03,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:46:03,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:46:03,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:46:03,973 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:46:03,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2022-11-25 15:46:07,056 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:46:07,261 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:46:07,262 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2022-11-25 15:46:07,268 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/data/d19b8818d/e34adc232368450aacdb2a47df917ea6/FLAG1a5cfbde0 [2022-11-25 15:46:07,285 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/data/d19b8818d/e34adc232368450aacdb2a47df917ea6 [2022-11-25 15:46:07,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:46:07,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:46:07,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:46:07,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:46:07,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:46:07,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34168bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07, skipping insertion in model container [2022-11-25 15:46:07,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:46:07,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:46:07,469 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/sv-benchmarks/c/loop-acceleration/phases_1-1.c[322,335] [2022-11-25 15:46:07,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:46:07,491 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:46:07,505 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/sv-benchmarks/c/loop-acceleration/phases_1-1.c[322,335] [2022-11-25 15:46:07,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:46:07,524 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:46:07,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07 WrapperNode [2022-11-25 15:46:07,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:46:07,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:46:07,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:46:07,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:46:07,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,555 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-11-25 15:46:07,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:46:07,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:46:07,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:46:07,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:46:07,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,582 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:46:07,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:46:07,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:46:07,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:46:07,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (1/1) ... [2022-11-25 15:46:07,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:46:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:07,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:46:07,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:46:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:46:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:46:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:46:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:46:07,754 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:46:07,756 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:46:07,917 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:46:07,931 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:46:07,931 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:46:07,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:46:07 BoogieIcfgContainer [2022-11-25 15:46:07,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:46:07,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:46:07,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:46:07,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:46:07,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:46:07" (1/3) ... [2022-11-25 15:46:07,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a9a290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:46:07, skipping insertion in model container [2022-11-25 15:46:07,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:07" (2/3) ... [2022-11-25 15:46:07,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a9a290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:46:07, skipping insertion in model container [2022-11-25 15:46:07,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:46:07" (3/3) ... [2022-11-25 15:46:07,951 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2022-11-25 15:46:07,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:46:07,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:46:08,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:46:08,044 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;@726ba648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:46:08,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:46:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 15:46:08,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:08,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:46:08,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2022-11-25 15:46:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:08,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999635144] [2022-11-25 15:46:08,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:08,246 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-25 15:46:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:08,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999635144] [2022-11-25 15:46:08,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999635144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:08,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:08,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:46:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289445095] [2022-11-25 15:46:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:08,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:46:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:46:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:46:08,308 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-25 15:46:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:08,323 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-11-25 15:46:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:46:08,325 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-25 15:46:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:08,333 INFO L225 Difference]: With dead ends: 20 [2022-11-25 15:46:08,333 INFO L226 Difference]: Without dead ends: 8 [2022-11-25 15:46:08,336 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-25 15:46:08,339 INFO L413 NwaCegarLoop]: 13 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, 13 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-25 15:46:08,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:46:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-25 15:46:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-25 15:46:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-25 15:46:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-25 15:46:08,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-11-25 15:46:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:08,372 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-25 15:46:08,372 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-25 15:46:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-11-25 15:46:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 15:46:08,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:08,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:46:08,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:46:08,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2022-11-25 15:46:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446610547] [2022-11-25 15:46:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:08,622 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-25 15:46:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:08,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446610547] [2022-11-25 15:46:08,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446610547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:08,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:08,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:46:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652539156] [2022-11-25 15:46:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:08,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:46:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:46:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:08,627 INFO L87 Difference]: Start difference. First operand 8 states and 9 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-25 15:46:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:08,644 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-11-25 15:46:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:46:08,644 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-25 15:46:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:08,645 INFO L225 Difference]: With dead ends: 16 [2022-11-25 15:46:08,645 INFO L226 Difference]: Without dead ends: 10 [2022-11-25 15:46:08,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 15:46:08,647 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:08,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:46:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-25 15:46:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-25 15:46:08,651 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-25 15:46:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-25 15:46:08,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-11-25 15:46:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:08,652 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-25 15:46:08,652 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-25 15:46:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-25 15:46:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 15:46:08,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:08,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:08,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:46:08,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2022-11-25 15:46:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:08,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580339014] [2022-11-25 15:46:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:08,773 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-25 15:46:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:08,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580339014] [2022-11-25 15:46:08,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580339014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:08,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226418374] [2022-11-25 15:46:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:08,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:08,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:08,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:08,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:46:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:08,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:46:08,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:08,874 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-25 15:46:08,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:08,925 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-25 15:46:08,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226418374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:08,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:08,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-25 15:46:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787381823] [2022-11-25 15:46:08,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:08,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:46:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:46:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:46:08,938 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-25 15:46:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:09,047 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-11-25 15:46:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:46:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 15:46:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:09,049 INFO L225 Difference]: With dead ends: 20 [2022-11-25 15:46:09,049 INFO L226 Difference]: Without dead ends: 14 [2022-11-25 15:46:09,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:46:09,050 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:09,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:46:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-25 15:46:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-25 15:46:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-25 15:46:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-25 15:46:09,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2022-11-25 15:46:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:09,056 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-25 15:46:09,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-25 15:46:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-11-25 15:46:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 15:46:09,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:09,057 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:09,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:09,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:09,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2022-11-25 15:46:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:09,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436339687] [2022-11-25 15:46:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436339687] [2022-11-25 15:46:09,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436339687] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909210753] [2022-11-25 15:46:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:09,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:09,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:09,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:09,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:46:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:09,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 15:46:09,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:09,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:09,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909210753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:09,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:09,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-11-25 15:46:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870702755] [2022-11-25 15:46:09,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:09,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:46:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:46:09,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:46:09,854 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-25 15:46:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:10,031 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-25 15:46:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:46:10,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 15:46:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:10,033 INFO L225 Difference]: With dead ends: 26 [2022-11-25 15:46:10,033 INFO L226 Difference]: Without dead ends: 19 [2022-11-25 15:46:10,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:46:10,035 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:10,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:46:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-25 15:46:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-25 15:46:10,042 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-25 15:46:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-25 15:46:10,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-11-25 15:46:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:10,044 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-25 15:46:10,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-25 15:46:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-25 15:46:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:46:10,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:10,045 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:10,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:10,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:10,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -549258615, now seen corresponding path program 2 times [2022-11-25 15:46:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865929655] [2022-11-25 15:46:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:46:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865929655] [2022-11-25 15:46:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865929655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898581398] [2022-11-25 15:46:10,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:46:10,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:10,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:10,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:10,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:46:10,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:46:10,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:10,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 15:46:10,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:10,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898581398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:11,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2022-11-25 15:46:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492549659] [2022-11-25 15:46:11,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 15:46:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:46:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:46:11,007 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:12,167 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-11-25 15:46:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:46:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:46:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:12,169 INFO L225 Difference]: With dead ends: 36 [2022-11-25 15:46:12,169 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 15:46:12,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=266, Unknown=0, NotChecked=0, Total=420 [2022-11-25 15:46:12,171 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:12,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:46:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 15:46:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-25 15:46:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-25 15:46:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-25 15:46:12,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2022-11-25 15:46:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:12,179 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-25 15:46:12,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-25 15:46:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 15:46:12,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:12,180 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 4, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:12,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:12,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:12,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash 379103926, now seen corresponding path program 3 times [2022-11-25 15:46:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:12,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213648168] [2022-11-25 15:46:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:12,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:46:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:12,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213648168] [2022-11-25 15:46:12,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213648168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:12,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242286951] [2022-11-25 15:46:12,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:46:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:12,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:12,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:46:12,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-25 15:46:12,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:12,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 15:46:12,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:12,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:13,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242286951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:13,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:13,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 22 [2022-11-25 15:46:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074581553] [2022-11-25 15:46:13,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:13,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 15:46:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 15:46:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-11-25 15:46:13,358 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 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-25 15:46:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:17,168 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2022-11-25 15:46:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:46:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 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) Word has length 24 [2022-11-25 15:46:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:17,171 INFO L225 Difference]: With dead ends: 60 [2022-11-25 15:46:17,171 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 15:46:17,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=345, Invalid=585, Unknown=0, NotChecked=0, Total=930 [2022-11-25 15:46:17,173 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:17,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 20 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:46:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 15:46:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-25 15:46:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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-25 15:46:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-25 15:46:17,186 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2022-11-25 15:46:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:17,186 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-25 15:46:17,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 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-25 15:46:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-25 15:46:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 15:46:17,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:17,188 INFO L195 NwaCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:17,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 15:46:17,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:17,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2044022996, now seen corresponding path program 4 times [2022-11-25 15:46:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:17,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312958657] [2022-11-25 15:46:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:46:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:17,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312958657] [2022-11-25 15:46:17,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312958657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:17,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523944880] [2022-11-25 15:46:17,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:46:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:17,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:17,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:46:17,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:46:17,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:17,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 15:46:17,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:18,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-25 15:46:18,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523944880] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:18,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 5] total 27 [2022-11-25 15:46:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279047635] [2022-11-25 15:46:18,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 15:46:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 15:46:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2022-11-25 15:46:18,602 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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-25 15:46:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:19,064 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-11-25 15:46:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 15:46:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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 44 [2022-11-25 15:46:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:19,065 INFO L225 Difference]: With dead ends: 75 [2022-11-25 15:46:19,065 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 15:46:19,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-11-25 15:46:19,067 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:19,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:46:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 15:46:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-11-25 15:46:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-25 15:46:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-11-25 15:46:19,080 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 44 [2022-11-25 15:46:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:19,080 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-11-25 15:46:19,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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-25 15:46:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-11-25 15:46:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 15:46:19,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:19,082 INFO L195 NwaCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:19,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:19,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:19,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1456868937, now seen corresponding path program 5 times [2022-11-25 15:46:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:19,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789548056] [2022-11-25 15:46:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:19,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:46:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:19,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789548056] [2022-11-25 15:46:19,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789548056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:19,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980717841] [2022-11-25 15:46:19,808 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:46:19,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:19,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:19,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:46:20,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2022-11-25 15:46:20,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:20,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 15:46:20,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:46:20,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:46:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980717841] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:21,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:21,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 36 [2022-11-25 15:46:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776425181] [2022-11-25 15:46:21,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:21,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 15:46:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 15:46:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=885, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 15:46:21,807 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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-25 15:46:57,644 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 115 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:46:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:57,652 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2022-11-25 15:46:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 15:46:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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 46 [2022-11-25 15:46:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:57,654 INFO L225 Difference]: With dead ends: 100 [2022-11-25 15:46:57,654 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 15:46:57,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=951, Invalid=1701, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 15:46:57,656 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:57,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 33 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:46:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 15:46:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-25 15:46:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 82 states have internal predecessors, (89), 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-25 15:46:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-25 15:46:57,674 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 46 [2022-11-25 15:46:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:57,674 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-25 15:46:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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-25 15:46:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-25 15:46:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 15:46:57,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:57,676 INFO L195 NwaCegarLoop]: trace histogram [38, 33, 5, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:57,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:57,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 15:46:57,883 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2002488685, now seen corresponding path program 6 times [2022-11-25 15:46:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:57,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822084176] [2022-11-25 15:46:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 306 proven. 1122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:46:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822084176] [2022-11-25 15:46:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822084176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606296653] [2022-11-25 15:46:59,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 15:46:59,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:59,466 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:59,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:47:01,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2022-11-25 15:47:01,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:47:01,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:47:01,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 25 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-11-25 15:47:01,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 25 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-11-25 15:47:02,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606296653] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:47:02,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:47:02,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 8, 9] total 49 [2022-11-25 15:47:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380805445] [2022-11-25 15:47:02,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:02,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 15:47:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:02,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 15:47:02,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 15:47:02,635 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 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-25 15:47:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:09,349 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2022-11-25 15:47:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 15:47:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 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 82 [2022-11-25 15:47:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:09,352 INFO L225 Difference]: With dead ends: 145 [2022-11-25 15:47:09,352 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 15:47:09,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=954, Invalid=2706, Unknown=0, NotChecked=0, Total=3660 [2022-11-25 15:47:09,355 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:09,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 15:47:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 15:47:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2022-11-25 15:47:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-25 15:47:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-11-25 15:47:09,393 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 82 [2022-11-25 15:47:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:09,394 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-11-25 15:47:09,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 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-25 15:47:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-11-25 15:47:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 15:47:09,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:09,399 INFO L195 NwaCegarLoop]: trace histogram [47, 35, 12, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:09,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:09,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 15:47:09,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 225002294, now seen corresponding path program 7 times [2022-11-25 15:47:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340386235] [2022-11-25 15:47:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 828 proven. 1260 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-25 15:47:11,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:11,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340386235] [2022-11-25 15:47:11,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340386235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:11,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327008274] [2022-11-25 15:47:11,344 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 15:47:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:11,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:11,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:11,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b056b8f2-07cd-411c-ac1b-b377b887ca35/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:47:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-25 15:47:11,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 387 proven. 1806 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:47:12,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 387 proven. 1806 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:47:18,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327008274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:47:18,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:47:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 45, 46] total 90 [2022-11-25 15:47:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475704759] [2022-11-25 15:47:18,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-25 15:47:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-25 15:47:18,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2150, Invalid=5860, Unknown=0, NotChecked=0, Total=8010 [2022-11-25 15:47:18,325 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 90 states, 90 states have (on average 2.0444444444444443) internal successors, (184), 90 states have internal predecessors, (184), 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-25 15:47:21,809 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65520))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse6 65520) (not (< .cse6 268435455)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse7 268435455)) (< .cse7 65520))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse8 268435455)) (< .cse8 65520))) (let ((.cse9 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse11 65520) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse12 65520) (not (< .cse12 268435455)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65520))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse19 65520) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 65520) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65520))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65520))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65520))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse38 65520) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65520))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse40 268435455)) (< .cse40 65520))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse41 65520) (not (< .cse41 268435455))))) is different from false [2022-11-25 15:47:23,828 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse17 268435455)) (< .cse17 65520))) (let ((.cse18 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse19 65520) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse20 268435455)) (< .cse20 65520))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse21 65520) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65520))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse24 65520) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65520))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse32 65520) (not (< .cse32 268435455)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455))))) is different from false [2022-11-25 15:48:59,192 WARN L233 SmtUtils]: Spent 35.84s on a formula simplification. DAG size of input: 243 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:49:02,131 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65520))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse32 65520) (not (< .cse32 268435455)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65520))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse37 65520) (not (< .cse37 268435455))))) is different from false [2022-11-25 15:49:05,163 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65520))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse33 65520) (not (< .cse33 268435455)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65520))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455))))) is different from false [2022-11-25 15:49:07,225 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse7 268435455)) (< .cse7 65520))) (let ((.cse8 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse11 65520) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65520))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse15 65520) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse17 268435455)) (< .cse17 65520))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse18 65520) (not (< .cse18 268435455)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 65520) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse20 268435455)) (< .cse20 65520))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse21 65520) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65520))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65520))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse28 65520) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse33 65520) (not (< .cse33 268435455)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65520))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse35 65520) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65520))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65520))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse38 65520) (not (< .cse38 268435455))))) is different from false [2022-11-25 15:50:26,473 WARN L233 SmtUtils]: Spent 21.15s on a formula simplification. DAG size of input: 229 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:50:28,776 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse15 65520) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse16 268435455)) (< .cse16 65520))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse18 65520) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse20 268435455)) (< .cse20 65520))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse21 65520) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65520))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65520))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse28 65520) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse32 65520) (not (< .cse32 268435455)))) (let ((.cse33 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65520))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse38 268435455)) (< .cse38 65520))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse39 65520) (not (< .cse39 268435455))))) is different from false [2022-11-25 15:50:30,802 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65520))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse24 65520) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse25 268435455)) (< .cse25 65520))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse28 65520) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65520))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse33 65520) (not (< .cse33 268435455)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65520))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse35 65520) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65520))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65520))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse38 65520) (not (< .cse38 268435455))))) is different from false [2022-11-25 15:50:34,009 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse15 65520) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse16 268435455)) (< .cse16 65520))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 65520) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65520))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse24 65520) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse25 268435455)) (< .cse25 65520))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse28 65520) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse33 65520) (not (< .cse33 268435455)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65520))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455))))) is different from false [2022-11-25 15:51:59,189 WARN L233 SmtUtils]: Spent 29.15s on a formula simplification. DAG size of input: 215 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:52:01,466 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65520))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse6 65520) (not (< .cse6 268435455)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse7 268435455)) (< .cse7 65520))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse8 268435455)) (< .cse8 65520))) (let ((.cse9 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse11 65520) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse12 65520) (not (< .cse12 268435455)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65520))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse19 65520) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65520))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65520))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65520))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse38 65520) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65520))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse40 268435455)) (< .cse40 65520))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse41 65520) (not (< .cse41 268435455))))) is different from false [2022-11-25 15:54:22,816 WARN L233 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 292 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:55:42,660 WARN L233 SmtUtils]: Spent 29.19s on a formula simplification. DAG size of input: 252 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:57:01,406 WARN L233 SmtUtils]: Spent 29.43s on a formula simplification. DAG size of input: 245 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:58:28,277 WARN L233 SmtUtils]: Spent 24.03s on a formula simplification. DAG size of input: 238 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:58:31,248 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65520))) (let ((.cse6 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse6 65520) (not (< .cse6 268435455)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse10 268435455)) (< .cse10 65520))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse12 65520) (not (< .cse12 268435455)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse13 65520) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 65520) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse17 268435455)) (< .cse17 65520))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse18 65520) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse21 65520) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse24 65520) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse25 268435455)) (< .cse25 65520))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65520))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse28 65520) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65520))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455))))) is different from false [2022-11-25 15:59:47,929 WARN L233 SmtUtils]: Spent 20.18s on a formula simplification. DAG size of input: 180 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:01:03,288 WARN L233 SmtUtils]: Spent 27.44s on a formula simplification. DAG size of input: 217 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)