./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:41:33,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:41:33,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:41:33,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:41:33,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:41:33,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:41:33,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:41:33,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:41:33,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:41:33,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:41:33,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:41:33,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:41:33,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:41:33,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:41:33,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:41:33,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:41:33,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:41:33,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:41:33,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:41:33,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:41:33,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:41:33,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:41:33,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:41:33,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:41:33,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:41:33,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:41:33,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:41:33,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:41:33,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:41:33,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:41:33,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:41:33,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:41:33,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:41:33,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:41:33,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:41:33,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:41:33,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:41:33,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:41:33,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:41:33,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:41:33,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:41:33,180 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:41:33,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:41:33,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:41:33,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:41:33,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:41:33,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:41:33,215 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:41:33,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:41:33,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:41:33,216 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:41:33,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:41:33,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:41:33,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:41:33,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:41:33,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:41:33,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:41:33,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:41:33,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:41:33,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:41:33,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:41:33,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:41:33,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:41:33,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:41:33,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:41:33,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:41:33,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:41:33,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:41:33,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:41:33,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:41:33,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:41:33,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:41:33,223 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:41:33,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:41:33,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:41:33,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 [2022-11-16 12:41:33,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:41:33,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:41:33,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:41:33,544 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:41:33,545 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:41:33,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2022-11-16 12:41:33,624 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/data/b6c9bc497/3324d13d3bac40f1b02d258a98d99148/FLAG0d811f616 [2022-11-16 12:41:34,033 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:41:34,034 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2022-11-16 12:41:34,039 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/data/b6c9bc497/3324d13d3bac40f1b02d258a98d99148/FLAG0d811f616 [2022-11-16 12:41:34,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/data/b6c9bc497/3324d13d3bac40f1b02d258a98d99148 [2022-11-16 12:41:34,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:41:34,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:41:34,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:41:34,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:41:34,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:41:34,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d227a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34, skipping insertion in model container [2022-11-16 12:41:34,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:41:34,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:41:34,728 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2022-11-16 12:41:34,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:41:34,756 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:41:34,777 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2022-11-16 12:41:34,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:41:34,805 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:41:34,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34 WrapperNode [2022-11-16 12:41:34,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:41:34,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:41:34,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:41:34,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:41:34,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,856 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-16 12:41:34,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:41:34,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:41:34,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:41:34,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:41:34,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,895 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:41:34,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:41:34,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:41:34,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:41:34,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (1/1) ... [2022-11-16 12:41:34,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:41:34,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:34,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:41:34,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:41:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:41:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:41:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:41:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:41:35,075 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:41:35,077 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:41:35,275 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:41:35,280 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:41:35,280 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:41:35,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:35 BoogieIcfgContainer [2022-11-16 12:41:35,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:41:35,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:41:35,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:41:35,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:41:35,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:41:34" (1/3) ... [2022-11-16 12:41:35,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b8c615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:41:35, skipping insertion in model container [2022-11-16 12:41:35,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:34" (2/3) ... [2022-11-16 12:41:35,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b8c615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:41:35, skipping insertion in model container [2022-11-16 12:41:35,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:35" (3/3) ... [2022-11-16 12:41:35,297 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2022-11-16 12:41:35,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:41:35,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:41:35,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:41:35,396 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;@287e7379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:41:35,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:41:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:41:35,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:35,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:41:35,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:35,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-16 12:41:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:35,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109156223] [2022-11-16 12:41:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109156223] [2022-11-16 12:41:35,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109156223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:35,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:35,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:41:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244218138] [2022-11-16 12:41:35,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:35,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:41:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:41:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:41:35,657 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:35,671 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-16 12:41:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:41:35,673 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-16 12:41:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:35,683 INFO L225 Difference]: With dead ends: 21 [2022-11-16 12:41:35,683 INFO L226 Difference]: Without dead ends: 9 [2022-11-16 12:41:35,686 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-16 12:41:35,691 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:35,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:41:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-16 12:41:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-16 12:41:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-16 12:41:35,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-16 12:41:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:35,734 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-16 12:41:35,735 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-16 12:41:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-16 12:41:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:41:35,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:35,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:41:35,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:41:35,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-16 12:41:35,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:35,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052242618] [2022-11-16 12:41:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:35,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052242618] [2022-11-16 12:41:35,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052242618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:35,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:35,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:41:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887921881] [2022-11-16 12:41:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:35,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:41:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:41:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:41:35,943 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:35,970 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-16 12:41:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:41:35,971 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-16 12:41:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:35,971 INFO L225 Difference]: With dead ends: 19 [2022-11-16 12:41:35,971 INFO L226 Difference]: Without dead ends: 12 [2022-11-16 12:41:35,972 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-16 12:41:35,973 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:35,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:41:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-16 12:41:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-16 12:41:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-16 12:41:35,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-16 12:41:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:35,979 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-16 12:41:35,979 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-16 12:41:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-16 12:41:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:41:35,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:35,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:35,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:41:35,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-16 12:41:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:35,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990967934] [2022-11-16 12:41:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:36,317 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-16 12:41:36,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:36,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990967934] [2022-11-16 12:41:36,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990967934] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:36,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893868355] [2022-11-16 12:41:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:36,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:36,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:41:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:36,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:41:36,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:36,500 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-16 12:41:36,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:41:36,572 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-16 12:41:36,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893868355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:41:36,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:41:36,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-16 12:41:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550522419] [2022-11-16 12:41:36,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:41:36,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:41:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:36,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:41:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:41:36,575 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:36,831 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-16 12:41:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:41:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 12:41:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:36,832 INFO L225 Difference]: With dead ends: 33 [2022-11-16 12:41:36,833 INFO L226 Difference]: Without dead ends: 22 [2022-11-16 12:41:36,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:41:36,835 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:36,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:41:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-16 12:41:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-11-16 12:41:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-16 12:41:36,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2022-11-16 12:41:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:36,842 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-16 12:41:36,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-16 12:41:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:41:36,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:36,843 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:36,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:41:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:37,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-16 12:41:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:37,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856233211] [2022-11-16 12:41:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:37,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856233211] [2022-11-16 12:41:37,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856233211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515168109] [2022-11-16 12:41:37,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:41:37,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:37,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:37,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:37,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:41:37,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:41:37,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:41:37,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:41:37,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 12:41:37,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:41:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515168109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:37,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:41:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-16 12:41:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881035512] [2022-11-16 12:41:37,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:37,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:41:37,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:41:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:41:37,677 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:37,749 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-11-16 12:41:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:41:37,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:41:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:37,752 INFO L225 Difference]: With dead ends: 30 [2022-11-16 12:41:37,752 INFO L226 Difference]: Without dead ends: 26 [2022-11-16 12:41:37,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:41:37,757 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:37,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:41:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-16 12:41:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-16 12:41:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-16 12:41:37,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-11-16 12:41:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:37,777 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-16 12:41:37,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-16 12:41:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:41:37,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:37,780 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:37,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:41:37,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:37,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash 491841168, now seen corresponding path program 1 times [2022-11-16 12:41:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:37,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835282370] [2022-11-16 12:41:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:41:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:38,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835282370] [2022-11-16 12:41:38,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835282370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:38,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707030996] [2022-11-16 12:41:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:38,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:38,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:38,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:41:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:38,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:41:38,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:41:38,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:41:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:38,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707030996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:41:38,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:41:38,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 14 [2022-11-16 12:41:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550530281] [2022-11-16 12:41:38,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:41:38,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:41:38,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:41:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:41:38,528 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:40,625 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-11-16 12:41:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:41:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:41:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:40,627 INFO L225 Difference]: With dead ends: 53 [2022-11-16 12:41:40,627 INFO L226 Difference]: Without dead ends: 43 [2022-11-16 12:41:40,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:41:40,628 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:40,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 29 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:41:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-16 12:41:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-11-16 12:41:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-16 12:41:40,638 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 18 [2022-11-16 12:41:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:40,638 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-16 12:41:40,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-16 12:41:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:41:40,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:40,639 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:40,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:41:40,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:40,848 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -191017413, now seen corresponding path program 2 times [2022-11-16 12:41:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:40,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703877477] [2022-11-16 12:41:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:41,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:41,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703877477] [2022-11-16 12:41:41,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703877477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:41,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973639472] [2022-11-16 12:41:41,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:41:41,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:41,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:41,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:41:41,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:41:41,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:41:41,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:41:41,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:41,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:41:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:41:41,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973639472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:41:41,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:41:41,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 21 [2022-11-16 12:41:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982529339] [2022-11-16 12:41:41,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:41:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 12:41:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 12:41:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:41:41,471 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:44,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:41:46,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:41:48,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:41:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:49,707 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-11-16 12:41:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:41:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 12:41:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:49,717 INFO L225 Difference]: With dead ends: 91 [2022-11-16 12:41:49,717 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 12:41:49,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:41:49,719 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:49,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-11-16 12:41:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 12:41:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-16 12:41:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-11-16 12:41:49,753 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 21 [2022-11-16 12:41:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:49,753 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-11-16 12:41:49,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-11-16 12:41:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 12:41:49,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:49,756 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:49,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:41:49,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:41:49,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1978693868, now seen corresponding path program 3 times [2022-11-16 12:41:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:49,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030223609] [2022-11-16 12:41:49,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:41:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:50,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030223609] [2022-11-16 12:41:50,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030223609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:50,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93071797] [2022-11-16 12:41:50,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:41:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:50,167 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:50,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:41:50,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:41:50,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:41:50,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:41:50,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-16 12:41:50,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:41:50,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93071797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:50,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:41:50,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-16 12:41:50,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957625135] [2022-11-16 12:41:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:50,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:41:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:41:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:41:50,393 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:50,461 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-11-16 12:41:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:41:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 12:41:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:50,468 INFO L225 Difference]: With dead ends: 83 [2022-11-16 12:41:50,468 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 12:41:50,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:41:50,469 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:50,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:41:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 12:41:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2022-11-16 12:41:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-16 12:41:50,493 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2022-11-16 12:41:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:50,493 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-16 12:41:50,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-16 12:41:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 12:41:50,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:50,495 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:50,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:41:50,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:50,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1598856071, now seen corresponding path program 4 times [2022-11-16 12:41:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135470350] [2022-11-16 12:41:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:41:50,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135470350] [2022-11-16 12:41:50,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135470350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894864204] [2022-11-16 12:41:50,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:41:50,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:50,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:50,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:50,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:41:50,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:41:50,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:41:50,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:41:50,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:41:51,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:41:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:41:51,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894864204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:41:51,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:41:51,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2022-11-16 12:41:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570040842] [2022-11-16 12:41:51,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:41:51,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 12:41:51,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 12:41:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:41:51,397 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:55,425 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2022-11-16 12:41:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:41:55,426 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-16 12:41:55,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:55,427 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:41:55,427 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 12:41:55,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=381, Invalid=611, Unknown=0, NotChecked=0, Total=992 [2022-11-16 12:41:55,429 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:55,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 15 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:41:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 12:41:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-16 12:41:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-11-16 12:41:55,435 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2022-11-16 12:41:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:55,435 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-11-16 12:41:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:41:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-11-16 12:41:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:41:55,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:55,437 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:41:55,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 12:41:55,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:55,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash 141362107, now seen corresponding path program 5 times [2022-11-16 12:41:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:55,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089388787] [2022-11-16 12:41:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 25 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:56,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:56,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089388787] [2022-11-16 12:41:56,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089388787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:56,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374439623] [2022-11-16 12:41:56,148 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:41:56,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:56,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:56,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:56,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:41:57,130 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-11-16 12:41:57,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:41:57,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 12:41:57,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:41:57,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:41:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:41:58,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374439623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:41:58,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:41:58,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 45 [2022-11-16 12:41:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19931197] [2022-11-16 12:41:58,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:41:58,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 12:41:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:58,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 12:41:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2022-11-16 12:41:58,530 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:42:01,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:42:44,974 WARN L233 SmtUtils]: Spent 29.94s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:42:47,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:43:14,519 WARN L233 SmtUtils]: Spent 22.52s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:44:19,153 WARN L233 SmtUtils]: Spent 23.21s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:44:20,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:22,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:25,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:27,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:29,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:31,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:33,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:35,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:37,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:39,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:41,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:43,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:44,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:46,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:48,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:44:50,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:33,039 WARN L233 SmtUtils]: Spent 18.18s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:45:35,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:37,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:39,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:41,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:43,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:45,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:47,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:49,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:51,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:52,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:45:54,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:46:22,108 WARN L233 SmtUtils]: Spent 11.23s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:46:56,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:47:00,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:47:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:02,508 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2022-11-16 12:47:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 12:47:02,509 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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 45 [2022-11-16 12:47:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:02,510 INFO L225 Difference]: With dead ends: 114 [2022-11-16 12:47:02,510 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 12:47:02,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 242.7s TimeCoverageRelationStatistics Valid=797, Invalid=3227, Unknown=16, NotChecked=250, Total=4290 [2022-11-16 12:47:02,512 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 47 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 62.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:02,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1028 Invalid, 23 Unknown, 6 Unchecked, 62.4s Time] [2022-11-16 12:47:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 12:47:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-11-16 12:47:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2022-11-16 12:47:02,533 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 45 [2022-11-16 12:47:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:02,533 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2022-11-16 12:47:02,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-11-16 12:47:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 12:47:02,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:02,535 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:02,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 12:47:02,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 12:47:02,741 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:02,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1567248470, now seen corresponding path program 6 times [2022-11-16 12:47:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:02,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625983874] [2022-11-16 12:47:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 109 proven. 260 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:47:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:03,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625983874] [2022-11-16 12:47:03,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625983874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:03,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957093158] [2022-11-16 12:47:03,142 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:47:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:03,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:03,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:03,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:47:03,216 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-16 12:47:03,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:47:03,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:47:03,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-16 12:47:03,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 149 proven. 75 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-16 12:47:03,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957093158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:47:03,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:47:03,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 7] total 25 [2022-11-16 12:47:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439650328] [2022-11-16 12:47:03,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:03,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:47:03,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:03,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:47:03,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:47:03,903 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:05,200 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2022-11-16 12:47:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 12:47:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 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 54 [2022-11-16 12:47:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:05,202 INFO L225 Difference]: With dead ends: 183 [2022-11-16 12:47:05,202 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 12:47:05,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=424, Invalid=1556, Unknown=0, NotChecked=0, Total=1980 [2022-11-16 12:47:05,204 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:05,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 22 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:47:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 12:47:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 100. [2022-11-16 12:47:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2022-11-16 12:47:05,235 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 54 [2022-11-16 12:47:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:05,235 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2022-11-16 12:47:05,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-11-16 12:47:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 12:47:05,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:05,237 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 16, 6, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:05,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:05,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:47:05,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:05,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:05,443 INFO L85 PathProgramCache]: Analyzing trace with hash -752211018, now seen corresponding path program 7 times [2022-11-16 12:47:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:05,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757204589] [2022-11-16 12:47:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 313 proven. 345 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-16 12:47:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757204589] [2022-11-16 12:47:06,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757204589] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992858240] [2022-11-16 12:47:06,143 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:47:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:06,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:06,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:47:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 12:47:06,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:47:06,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:47:08,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992858240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:47:08,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:47:08,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 42 [2022-11-16 12:47:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981944531] [2022-11-16 12:47:08,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:08,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 12:47:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 12:47:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1224, Unknown=0, NotChecked=0, Total=1722 [2022-11-16 12:47:08,097 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:42,281 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2022-11-16 12:48:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 12:48:42,282 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 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 72 [2022-11-16 12:48:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:42,283 INFO L225 Difference]: With dead ends: 169 [2022-11-16 12:48:42,284 INFO L226 Difference]: Without dead ends: 136 [2022-11-16 12:48:42,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 94.9s TimeCoverageRelationStatistics Valid=1254, Invalid=2286, Unknown=0, NotChecked=0, Total=3540 [2022-11-16 12:48:42,286 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 135 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:42,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 64 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:48:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-16 12:48:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-16 12:48:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2022-11-16 12:48:42,317 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 72 [2022-11-16 12:48:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:42,317 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2022-11-16 12:48:42,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2022-11-16 12:48:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:48:42,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:42,321 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 38, 5, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:42,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:42,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:48:42,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1538427173, now seen corresponding path program 8 times [2022-11-16 12:48:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022413333] [2022-11-16 12:48:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 541 proven. 2185 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 12:48:44,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:44,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022413333] [2022-11-16 12:48:44,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022413333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:44,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194670816] [2022-11-16 12:48:44,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:48:44,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:44,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:44,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:44,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dc2dbd-ec49-4cc1-bc1a-41beec953e67/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:48:44,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:48:44,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:44,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-16 12:48:44,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:48,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2712 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-16 12:48:54,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194670816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:54,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:54,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 52, 42] total 131 [2022-11-16 12:48:54,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461716291] [2022-11-16 12:48:54,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:54,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-16 12:48:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-16 12:48:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2287, Invalid=14743, Unknown=0, NotChecked=0, Total=17030 [2022-11-16 12:48:54,855 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand has 131 states, 131 states have (on average 2.885496183206107) internal successors, (378), 131 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:49:00,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:02,697 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:04,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:06,816 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:08,958 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:11,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:13,047 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:15,067 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:17,086 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:19,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:21,116 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:23,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:49:25,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:19,957 WARN L233 SmtUtils]: Spent 2.14m on a formula simplification that was a NOOP. DAG size: 165 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:54:21,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:22,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:24,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:27,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:29,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:31,412 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:33,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:35,474 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:37,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:39,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:41,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-16 12:54:43,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false