./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/nested_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/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_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/nested_1-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/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_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/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 8828f6ff39cd2bcfba4fe3d04f0119d60137bcad91eabef2e2b840cbd0802b98 --- 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 11:57:23,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:57:23,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:57:23,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:57:23,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:57:23,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:57:23,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:57:23,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:57:23,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:57:23,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:57:23,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:57:23,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:57:23,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:57:23,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:57:23,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:57:23,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:57:23,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:57:23,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:57:23,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:57:23,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:57:23,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:57:23,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:57:23,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:57:23,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:57:23,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:57:23,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:57:23,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:57:23,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:57:23,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:57:23,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:57:23,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:57:23,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:57:23,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:57:23,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:57:23,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:57:23,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:57:23,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:57:23,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:57:23,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:57:23,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:57:23,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:57:23,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:57:23,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:57:23,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:57:23,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:57:23,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:57:23,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:57:23,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:57:23,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:57:23,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:57:23,414 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:57:23,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:57:23,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:57:23,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:57:23,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:57:23,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:57:23,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:57:23,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:57:23,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:57:23,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:57:23,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:57:23,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:57:23,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:57:23,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:57:23,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:57:23,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:57:23,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:23,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:57:23,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:57:23,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:57:23,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:57:23,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:57:23,422 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:57:23,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:57:23,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:57:23,423 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_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/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_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/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 -> 8828f6ff39cd2bcfba4fe3d04f0119d60137bcad91eabef2e2b840cbd0802b98 [2022-11-16 11:57:23,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:57:23,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:57:23,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:57:23,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:57:23,756 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:57:23,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/loop-acceleration/nested_1-2.c [2022-11-16 11:57:23,827 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/data/cbc2615d1/29d124be4b6e4a28a0faa4c283cadfb0/FLAG4cda02ccd [2022-11-16 11:57:24,313 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:57:24,314 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/sv-benchmarks/c/loop-acceleration/nested_1-2.c [2022-11-16 11:57:24,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/data/cbc2615d1/29d124be4b6e4a28a0faa4c283cadfb0/FLAG4cda02ccd [2022-11-16 11:57:24,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/data/cbc2615d1/29d124be4b6e4a28a0faa4c283cadfb0 [2022-11-16 11:57:24,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:57:24,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:57:24,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:24,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:57:24,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:57:24,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:24,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ebb43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24, skipping insertion in model container [2022-11-16 11:57:24,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:24,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:57:24,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:57:24,928 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_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/sv-benchmarks/c/loop-acceleration/nested_1-2.c[322,335] [2022-11-16 11:57:24,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:24,948 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:57:24,961 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_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/sv-benchmarks/c/loop-acceleration/nested_1-2.c[322,335] [2022-11-16 11:57:24,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:24,976 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:57:24,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24 WrapperNode [2022-11-16 11:57:24,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:24,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:24,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:57:24,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:57:24,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:24,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,008 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-11-16 11:57:25,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:25,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:57:25,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:57:25,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:57:25,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:57:25,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:57:25,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:57:25,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:57:25,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (1/1) ... [2022-11-16 11:57:25,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:25,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:25,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:57:25,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:57:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:57:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:57:25,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:57:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:57:25,201 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:57:25,203 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:57:25,335 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:57:25,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:57:25,355 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:57:25,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:25 BoogieIcfgContainer [2022-11-16 11:57:25,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:57:25,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:57:25,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:57:25,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:57:25,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:24" (1/3) ... [2022-11-16 11:57:25,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:25, skipping insertion in model container [2022-11-16 11:57:25,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:24" (2/3) ... [2022-11-16 11:57:25,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:25, skipping insertion in model container [2022-11-16 11:57:25,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:25" (3/3) ... [2022-11-16 11:57:25,371 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2022-11-16 11:57:25,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:57:25,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:57:25,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:57:25,440 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;@2b08386f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:57:25,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:57:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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 11:57:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:57:25,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:25,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:57:25,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 889646744, now seen corresponding path program 1 times [2022-11-16 11:57:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:25,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917643372] [2022-11-16 11:57:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:25,810 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 11:57:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:25,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917643372] [2022-11-16 11:57:25,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917643372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:25,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:25,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:25,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263974596] [2022-11-16 11:57:25,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:25,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:25,879 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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 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 11:57:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:25,910 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2022-11-16 11:57:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:25,913 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 11:57:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:25,936 INFO L225 Difference]: With dead ends: 27 [2022-11-16 11:57:25,936 INFO L226 Difference]: Without dead ends: 12 [2022-11-16 11:57:25,938 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 11:57:25,958 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:25,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:57:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-16 11:57:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2022-11-16 11:57:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-16 11:57:26,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-11-16 11:57:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:26,006 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-16 11:57:26,006 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 11:57:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-16 11:57:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:57:26,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:26,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:26,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:57:26,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:26,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 704531011, now seen corresponding path program 1 times [2022-11-16 11:57:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:26,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602704614] [2022-11-16 11:57:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:26,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602704614] [2022-11-16 11:57:26,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602704614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:26,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:26,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63017782] [2022-11-16 11:57:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:26,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:26,165 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 11:57:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:26,190 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-11-16 11:57:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:57:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:26,195 INFO L225 Difference]: With dead ends: 18 [2022-11-16 11:57:26,195 INFO L226 Difference]: Without dead ends: 11 [2022-11-16 11:57:26,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:26,197 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:26,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:57:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-16 11:57:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-16 11:57:26,206 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 11:57:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-16 11:57:26,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2022-11-16 11:57:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:26,209 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-16 11:57:26,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 11:57:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-16 11:57:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:57:26,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:26,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:57:26,215 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1982141191, now seen corresponding path program 1 times [2022-11-16 11:57:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206036015] [2022-11-16 11:57:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:26,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206036015] [2022-11-16 11:57:26,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206036015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:26,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156848752] [2022-11-16 11:57:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:26,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:26,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:26,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:26,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:57:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:26,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:57:26,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:26,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:26,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156848752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:26,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:26,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-16 11:57:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563129381] [2022-11-16 11:57:26,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:26,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:57:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:26,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:57:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:57:26,592 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:26,661 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-11-16 11:57:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:57:26,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:57:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:26,664 INFO L225 Difference]: With dead ends: 22 [2022-11-16 11:57:26,664 INFO L226 Difference]: Without dead ends: 14 [2022-11-16 11:57:26,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:57:26,666 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:26,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:57:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-16 11:57:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-16 11:57:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-16 11:57:26,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2022-11-16 11:57:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:26,672 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-16 11:57:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-16 11:57:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:57:26,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:26,673 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:26,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:57:26,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:26,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1640782659, now seen corresponding path program 2 times [2022-11-16 11:57:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:26,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008624494] [2022-11-16 11:57:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008624494] [2022-11-16 11:57:27,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008624494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075496542] [2022-11-16 11:57:27,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:57:27,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:27,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:27,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:27,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:57:27,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:57:27,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:27,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:57:27,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:57:27,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:57:27,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075496542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:27,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:27,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-11-16 11:57:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661934446] [2022-11-16 11:57:27,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:27,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:57:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:57:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:57:27,392 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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 11:57:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:27,975 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-11-16 11:57:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:57:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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 13 [2022-11-16 11:57:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:27,977 INFO L225 Difference]: With dead ends: 50 [2022-11-16 11:57:27,977 INFO L226 Difference]: Without dead ends: 39 [2022-11-16 11:57:27,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=896, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:57:27,979 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:27,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 38 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-16 11:57:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-16 11:57:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-16 11:57:27,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2022-11-16 11:57:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:27,992 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-16 11:57:27,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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 11:57:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-16 11:57:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 11:57:27,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:27,994 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:28,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:28,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:28,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1035828652, now seen corresponding path program 3 times [2022-11-16 11:57:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082041463] [2022-11-16 11:57:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-16 11:57:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082041463] [2022-11-16 11:57:28,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082041463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822235804] [2022-11-16 11:57:28,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:57:28,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:28,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:28,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:57:28,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-16 11:57:28,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:28,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:57:28,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 85 proven. 115 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-16 11:57:28,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 115 proven. 15 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:57:28,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822235804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:28,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:28,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-11-16 11:57:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382071084] [2022-11-16 11:57:28,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:28,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:57:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:57:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:57:28,910 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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 11:57:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:29,209 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2022-11-16 11:57:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:57:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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) Word has length 38 [2022-11-16 11:57:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:29,212 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:57:29,212 INFO L226 Difference]: Without dead ends: 59 [2022-11-16 11:57:29,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:57:29,215 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:29,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-16 11:57:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-16 11:57:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 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 11:57:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-11-16 11:57:29,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 38 [2022-11-16 11:57:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:29,246 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-11-16 11:57:29,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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 11:57:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-11-16 11:57:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:57:29,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:29,251 INFO L195 NwaCegarLoop]: trace histogram [40, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:29,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:29,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:29,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1228631464, now seen corresponding path program 4 times [2022-11-16 11:57:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:29,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461698480] [2022-11-16 11:57:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-11-16 11:57:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:29,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461698480] [2022-11-16 11:57:29,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461698480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:29,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121385725] [2022-11-16 11:57:29,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:57:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:29,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:29,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:29,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:57:29,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:57:29,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:29,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 11:57:29,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 11:57:30,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 30 proven. 752 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 11:57:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121385725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:30,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:30,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 23 [2022-11-16 11:57:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3897114] [2022-11-16 11:57:30,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:30,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:57:30,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:57:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:57:30,565 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:32,138 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2022-11-16 11:57:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:57:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-16 11:57:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:32,140 INFO L225 Difference]: With dead ends: 141 [2022-11-16 11:57:32,140 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 11:57:32,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=598, Unknown=0, NotChecked=0, Total=930 [2022-11-16 11:57:32,141 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 85 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:32,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 96 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:57:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 11:57:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-16 11:57:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.0808823529411764) internal successors, (147), 136 states have internal predecessors, (147), 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 11:57:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-11-16 11:57:32,172 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 58 [2022-11-16 11:57:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:32,173 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-11-16 11:57:32,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-11-16 11:57:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 11:57:32,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:32,175 INFO L195 NwaCegarLoop]: trace histogram [100, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:32,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:32,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:32,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1191832584, now seen corresponding path program 5 times [2022-11-16 11:57:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:32,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931741728] [2022-11-16 11:57:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-11-16 11:57:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931741728] [2022-11-16 11:57:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931741728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:33,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597092285] [2022-11-16 11:57:33,265 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:57:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:33,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:33,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:57:38,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2022-11-16 11:57:38,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:38,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:57:38,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-11-16 11:57:38,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-11-16 11:57:39,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597092285] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:57:39,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:57:39,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-16 11:57:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801492182] [2022-11-16 11:57:39,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:39,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:57:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:57:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:57:39,575 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 25 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 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 11:57:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:44,856 INFO L93 Difference]: Finished difference Result 297 states and 330 transitions. [2022-11-16 11:57:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:57:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 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 136 [2022-11-16 11:57:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:44,859 INFO L225 Difference]: With dead ends: 297 [2022-11-16 11:57:44,859 INFO L226 Difference]: Without dead ends: 293 [2022-11-16 11:57:44,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:57:44,861 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:44,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 303 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:57:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-16 11:57:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-11-16 11:57:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.0787671232876712) internal successors, (315), 292 states have internal predecessors, (315), 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 11:57:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 315 transitions. [2022-11-16 11:57:44,943 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 315 transitions. Word has length 136 [2022-11-16 11:57:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:44,946 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 315 transitions. [2022-11-16 11:57:44,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 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 11:57:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 315 transitions. [2022-11-16 11:57:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-16 11:57:44,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:44,959 INFO L195 NwaCegarLoop]: trace histogram [220, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:44,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:45,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:57:45,168 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1761742648, now seen corresponding path program 6 times [2022-11-16 11:57:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740233990] [2022-11-16 11:57:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29645 backedges. 0 proven. 28435 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-11-16 11:57:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:47,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740233990] [2022-11-16 11:57:47,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740233990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:47,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293938666] [2022-11-16 11:57:47,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:57:47,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:47,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:47,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:58:40,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 94 check-sat command(s) [2022-11-16 11:58:40,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:58:40,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 11:58:40,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 29645 backedges. 0 proven. 28435 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-11-16 11:58:41,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:58:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29645 backedges. 0 proven. 28435 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-11-16 11:58:46,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293938666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:58:46,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:58:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2022-11-16 11:58:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556517758] [2022-11-16 11:58:46,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:46,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:58:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:58:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 11:58:46,530 INFO L87 Difference]: Start difference. First operand 293 states and 315 transitions. Second operand has 50 states, 50 states have (on average 3.72) internal successors, (186), 50 states have internal predecessors, (186), 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 11:59:07,679 WARN L233 SmtUtils]: Spent 16.09s on a formula simplification. DAG size of input: 134 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:59:27,754 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 128 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:59:47,619 WARN L233 SmtUtils]: Spent 10.65s on a formula simplification. DAG size of input: 122 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:00:08,030 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 116 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:00:50,238 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 98 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:01:45,196 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 74 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:07:14,913 WARN L233 SmtUtils]: Spent 4.41m on a formula simplification. DAG size of input: 136 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:07:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:07:15,386 INFO L93 Difference]: Finished difference Result 609 states and 678 transitions. [2022-11-16 12:07:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-16 12:07:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.72) internal successors, (186), 50 states have internal predecessors, (186), 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 292 [2022-11-16 12:07:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:07:15,392 INFO L225 Difference]: With dead ends: 609 [2022-11-16 12:07:15,392 INFO L226 Difference]: Without dead ends: 605 [2022-11-16 12:07:15,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 559 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 511.3s TimeCoverageRelationStatistics Valid=1835, Invalid=3411, Unknown=10, NotChecked=0, Total=5256 [2022-11-16 12:07:15,396 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 267 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:07:15,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1153 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:07:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-16 12:07:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2022-11-16 12:07:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.0778145695364238) internal successors, (651), 604 states have internal predecessors, (651), 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:07:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 651 transitions. [2022-11-16 12:07:15,478 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 651 transitions. Word has length 292 [2022-11-16 12:07:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:07:15,479 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 651 transitions. [2022-11-16 12:07:15,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.72) internal successors, (186), 50 states have internal predecessors, (186), 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:07:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 651 transitions. [2022-11-16 12:07:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2022-11-16 12:07:15,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:07:15,491 INFO L195 NwaCegarLoop]: trace histogram [460, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-11-16 12:07:15,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 12:07:15,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:07:15,713 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:07:15,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:07:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash -577378888, now seen corresponding path program 7 times [2022-11-16 12:07:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:07:15,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983781431] [2022-11-16 12:07:15,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:07:15,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:07:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:07:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 129881 backedges. 0 proven. 127351 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2022-11-16 12:07:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:07:23,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983781431] [2022-11-16 12:07:23,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983781431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:07:23,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040315735] [2022-11-16 12:07:23,761 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:07:23,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:07:23,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:07:23,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:07:23,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486b42c1-196c-4dd3-b2a7-e7cfc1b38fe8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:07:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:07:24,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 12:07:24,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:07:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 129881 backedges. 0 proven. 127351 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2022-11-16 12:07:26,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:07:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 129881 backedges. 0 proven. 127351 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2022-11-16 12:07:34,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040315735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:07:34,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:07:34,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-11-16 12:07:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340957185] [2022-11-16 12:07:34,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:07:34,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-16 12:07:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:07:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-16 12:07:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2494, Invalid=6818, Unknown=0, NotChecked=0, Total=9312 [2022-11-16 12:07:34,261 INFO L87 Difference]: Start difference. First operand 605 states and 651 transitions. Second operand has 97 states, 97 states have (on average 3.8969072164948453) internal successors, (378), 97 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:07:38,960 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455)) is different from false [2022-11-16 12:08:48,137 WARN L233 SmtUtils]: Spent 15.55s on a formula simplification. DAG size of input: 188 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:08:50,190 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455)) is different from false [2022-11-16 12:08:52,204 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455)) is different from false [2022-11-16 12:08:54,232 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:10:09,656 WARN L233 SmtUtils]: Spent 22.38s on a formula simplification. DAG size of input: 180 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:10:11,705 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:10:13,725 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:11:09,865 WARN L233 SmtUtils]: Spent 13.98s on a formula simplification. DAG size of input: 174 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:11:11,913 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:11:13,928 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:12:24,785 WARN L233 SmtUtils]: Spent 16.65s on a formula simplification. DAG size of input: 166 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:12:26,839 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:12:28,862 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:12:30,902 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2022-11-16 12:12:32,916 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false