./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/reducercommutativity/max05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:05:21,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:05:21,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:05:21,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:05:21,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:05:21,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:05:21,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:05:21,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:05:21,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:05:21,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:05:21,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:05:21,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:05:21,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:05:21,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:05:21,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:05:21,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:05:21,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:05:21,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:05:21,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:05:21,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:05:21,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:05:21,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:05:21,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:05:21,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:05:22,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:05:22,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:05:22,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:05:22,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:05:22,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:05:22,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:05:22,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:05:22,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:05:22,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:05:22,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:05:22,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:05:22,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:05:22,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:05:22,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:05:22,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:05:22,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:05:22,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:05:22,033 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:05:22,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:05:22,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:05:22,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:05:22,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:05:22,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:05:22,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:05:22,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:05:22,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:05:22,082 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:05:22,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:05:22,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:05:22,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:05:22,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:05:22,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:05:22,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:05:22,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:05:22,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:05:22,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:05:22,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:05:22,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:05:22,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:05:22,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:05:22,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:05:22,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:05:22,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:05:22,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:05:22,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:05:22,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:05:22,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:05:22,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:05:22,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:05:22,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:05:22,089 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:05:22,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:05:22,089 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2022-11-25 17:05:22,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:05:22,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:05:22,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:05:22,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:05:22,506 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:05:22,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/reducercommutativity/max05-1.i [2022-11-25 17:05:25,955 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:05:26,239 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:05:26,240 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/sv-benchmarks/c/reducercommutativity/max05-1.i [2022-11-25 17:05:26,249 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/data/7b63ab7fc/91e01cd7cdec4ba48894b9708532a84e/FLAG36d73626a [2022-11-25 17:05:26,274 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/data/7b63ab7fc/91e01cd7cdec4ba48894b9708532a84e [2022-11-25 17:05:26,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:05:26,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:05:26,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:05:26,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:05:26,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:05:26,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c718e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26, skipping insertion in model container [2022-11-25 17:05:26,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:05:26,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:05:26,529 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/sv-benchmarks/c/reducercommutativity/max05-1.i[1284,1297] [2022-11-25 17:05:26,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:05:26,545 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:05:26,571 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/sv-benchmarks/c/reducercommutativity/max05-1.i[1284,1297] [2022-11-25 17:05:26,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:05:26,588 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:05:26,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26 WrapperNode [2022-11-25 17:05:26,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:05:26,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:05:26,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:05:26,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:05:26,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,626 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2022-11-25 17:05:26,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:05:26,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:05:26,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:05:26,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:05:26,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,655 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:05:26,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:05:26,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:05:26,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:05:26,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (1/1) ... [2022-11-25 17:05:26,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:05:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:26,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:05:26,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:05:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:05:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-11-25 17:05:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-11-25 17:05:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:05:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:05:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:05:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:05:26,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:05:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:05:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:05:26,835 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:05:26,838 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:05:27,067 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:05:27,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:05:27,081 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 17:05:27,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:27 BoogieIcfgContainer [2022-11-25 17:05:27,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:05:27,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:05:27,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:05:27,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:05:27,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:05:26" (1/3) ... [2022-11-25 17:05:27,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0c951e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:05:27, skipping insertion in model container [2022-11-25 17:05:27,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:26" (2/3) ... [2022-11-25 17:05:27,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0c951e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:05:27, skipping insertion in model container [2022-11-25 17:05:27,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:27" (3/3) ... [2022-11-25 17:05:27,101 INFO L112 eAbstractionObserver]: Analyzing ICFG max05-1.i [2022-11-25 17:05:27,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:05:27,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:05:27,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:05:27,234 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;@733764fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:05:27,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:05:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:05:27,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:27,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:27,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash -528134526, now seen corresponding path program 1 times [2022-11-25 17:05:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398156589] [2022-11-25 17:05:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:05:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:05:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 17:05:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:05:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398156589] [2022-11-25 17:05:27,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398156589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:27,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:05:27,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:05:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703806757] [2022-11-25 17:05:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:05:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:05:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:05:27,583 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:05:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:27,619 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-11-25 17:05:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:05:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-25 17:05:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:27,631 INFO L225 Difference]: With dead ends: 52 [2022-11-25 17:05:27,631 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 17:05:27,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:05:27,648 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:27,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 17:05:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 17:05:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-25 17:05:27,690 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 28 [2022-11-25 17:05:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:27,690 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-25 17:05:27,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:05:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-25 17:05:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:05:27,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:27,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:05:27,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -321958693, now seen corresponding path program 1 times [2022-11-25 17:05:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860264378] [2022-11-25 17:05:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:05:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:05:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 17:05:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 17:05:27,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:27,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860264378] [2022-11-25 17:05:27,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860264378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:27,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523282145] [2022-11-25 17:05:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:27,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:27,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:27,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:28,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:05:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:28,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:05:28,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:05:28,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:05:28,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523282145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:05:28,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-25 17:05:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634778329] [2022-11-25 17:05:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:28,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:05:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:05:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:05:28,213 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:05:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:28,237 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-25 17:05:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:05:28,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-25 17:05:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:28,239 INFO L225 Difference]: With dead ends: 46 [2022-11-25 17:05:28,239 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 17:05:28,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:05:28,241 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:28,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 17:05:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-25 17:05:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-25 17:05:28,250 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 28 [2022-11-25 17:05:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:28,251 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-25 17:05:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:05:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-25 17:05:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:05:28,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:28,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:28,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:28,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-25 17:05:28,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1777476163, now seen corresponding path program 1 times [2022-11-25 17:05:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:28,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353459110] [2022-11-25 17:05:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:05:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:05:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:05:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:05:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:28,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353459110] [2022-11-25 17:05:28,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353459110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:28,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065539292] [2022-11-25 17:05:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:28,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:28,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:28,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:05:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:28,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:05:28,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:05:28,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:05:28,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065539292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:28,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:05:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-25 17:05:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626915300] [2022-11-25 17:05:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:28,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:05:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:28,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:05:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:05:28,820 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:05:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:28,838 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-11-25 17:05:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:05:28,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-11-25 17:05:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:28,840 INFO L225 Difference]: With dead ends: 48 [2022-11-25 17:05:28,840 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 17:05:28,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:05:28,842 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:28,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 17:05:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-11-25 17:05:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-25 17:05:28,850 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 30 [2022-11-25 17:05:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:28,850 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-25 17:05:28,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:05:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-25 17:05:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:05:28,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:28,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:28,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:29,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:29,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1540631384, now seen corresponding path program 1 times [2022-11-25 17:05:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793929720] [2022-11-25 17:05:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:05:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:05:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 17:05:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:05:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793929720] [2022-11-25 17:05:29,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793929720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:29,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214934558] [2022-11-25 17:05:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:29,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:29,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:29,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:29,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:05:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:05:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:05:29,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:05:29,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214934558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:29,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:05:29,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-25 17:05:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794704463] [2022-11-25 17:05:29,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:29,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:05:29,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:05:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:05:29,445 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:05:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:29,473 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-25 17:05:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:05:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-25 17:05:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:29,475 INFO L225 Difference]: With dead ends: 43 [2022-11-25 17:05:29,476 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 17:05:29,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:05:29,477 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 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-25 17:05:29,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 17:05:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-25 17:05:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-11-25 17:05:29,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 42 [2022-11-25 17:05:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:29,498 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-11-25 17:05:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:05:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-11-25 17:05:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 17:05:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:29,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:29,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:29,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -180199466, now seen corresponding path program 1 times [2022-11-25 17:05:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446288229] [2022-11-25 17:05:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:05:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:05:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 17:05:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:05:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:29,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446288229] [2022-11-25 17:05:29,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446288229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:29,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556689279] [2022-11-25 17:05:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:29,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:29,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:29,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:29,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:05:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:30,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:05:30,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 17:05:30,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 17:05:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556689279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:30,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:05:30,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-11-25 17:05:30,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865409320] [2022-11-25 17:05:30,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:30,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:05:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:05:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:05:30,159 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:05:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:30,245 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-11-25 17:05:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:05:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2022-11-25 17:05:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:30,252 INFO L225 Difference]: With dead ends: 62 [2022-11-25 17:05:30,252 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 17:05:30,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:05:30,258 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 17:05:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-11-25 17:05:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-25 17:05:30,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 44 [2022-11-25 17:05:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:30,281 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-25 17:05:30,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:05:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-25 17:05:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 17:05:30,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:30,287 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:30,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:30,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:30,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1875433, now seen corresponding path program 2 times [2022-11-25 17:05:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:30,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983238408] [2022-11-25 17:05:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:05:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 17:05:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:05:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-25 17:05:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:30,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983238408] [2022-11-25 17:05:30,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983238408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:30,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086371134] [2022-11-25 17:05:30,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:05:30,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:30,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:30,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:30,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:05:30,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:05:30,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:30,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:05:30,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-25 17:05:30,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-25 17:05:31,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086371134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:31,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:05:31,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-11-25 17:05:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044477380] [2022-11-25 17:05:31,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:31,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:05:31,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:31,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:05:31,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:05:31,023 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:05:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:31,070 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-11-25 17:05:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:05:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2022-11-25 17:05:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:31,072 INFO L225 Difference]: With dead ends: 68 [2022-11-25 17:05:31,072 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 17:05:31,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:05:31,073 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:31,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 17:05:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-11-25 17:05:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-11-25 17:05:31,088 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 62 [2022-11-25 17:05:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:31,090 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-11-25 17:05:31,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:05:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-11-25 17:05:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 17:05:31,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:31,093 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:31,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:31,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:31,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash -50192777, now seen corresponding path program 3 times [2022-11-25 17:05:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:31,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569280364] [2022-11-25 17:05:31,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:31,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:05:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 17:05:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:05:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 17:05:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:31,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569280364] [2022-11-25 17:05:31,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569280364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:31,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750897446] [2022-11-25 17:05:31,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:05:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:31,535 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:31,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:05:31,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 17:05:31,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:31,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:05:31,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 17:05:31,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 17:05:31,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750897446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:31,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:05:31,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-25 17:05:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820155685] [2022-11-25 17:05:31,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:31,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:05:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:05:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:05:31,779 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 17:05:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:31,838 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-11-25 17:05:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:05:31,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-11-25 17:05:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:31,843 INFO L225 Difference]: With dead ends: 80 [2022-11-25 17:05:31,843 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 17:05:31,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:05:31,849 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:31,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 17:05:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 17:05:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-25 17:05:31,866 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 66 [2022-11-25 17:05:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:31,866 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-25 17:05:31,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 17:05:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-25 17:05:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-25 17:05:31,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:31,870 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:31,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:32,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:32,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -135945016, now seen corresponding path program 4 times [2022-11-25 17:05:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:32,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486918811] [2022-11-25 17:05:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:05:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:05:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:05:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2022-11-25 17:05:32,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:32,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486918811] [2022-11-25 17:05:32,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486918811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:32,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115645777] [2022-11-25 17:05:32,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:05:32,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:32,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:32,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:32,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:05:32,521 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:05:32,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:32,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:05:32,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-11-25 17:05:32,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2022-11-25 17:05:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115645777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:32,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:05:32,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-25 17:05:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568299574] [2022-11-25 17:05:32,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:32,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:05:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:05:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:05:32,620 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:05:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:32,646 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-11-25 17:05:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:05:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 102 [2022-11-25 17:05:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:32,648 INFO L225 Difference]: With dead ends: 88 [2022-11-25 17:05:32,648 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 17:05:32,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:05:32,650 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:32,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 17:05:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 17:05:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:05:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-11-25 17:05:32,677 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 102 [2022-11-25 17:05:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:32,679 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-11-25 17:05:32,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:05:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-11-25 17:05:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-25 17:05:32,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:32,688 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:32,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:32,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:32,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1996885060, now seen corresponding path program 5 times [2022-11-25 17:05:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:32,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141946644] [2022-11-25 17:05:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:34,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:05:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:05:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:05:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 13 proven. 379 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-11-25 17:05:35,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141946644] [2022-11-25 17:05:35,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141946644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765806468] [2022-11-25 17:05:35,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:05:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:35,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:35,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:05:36,135 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-25 17:05:36,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:36,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-25 17:05:36,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:36,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-25 17:05:38,098 INFO L321 Elim1Store]: treesize reduction 194, result has 19.8 percent of original size [2022-11-25 17:05:38,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 82 [2022-11-25 17:05:38,384 INFO L321 Elim1Store]: treesize reduction 204, result has 11.7 percent of original size [2022-11-25 17:05:38,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 107 treesize of output 70 [2022-11-25 17:05:38,685 INFO L321 Elim1Store]: treesize reduction 113, result has 17.5 percent of original size [2022-11-25 17:05:38,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 95 treesize of output 65 [2022-11-25 17:05:38,956 INFO L321 Elim1Store]: treesize reduction 110, result has 2.7 percent of original size [2022-11-25 17:05:38,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 76 treesize of output 49 [2022-11-25 17:05:39,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:05:39,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2022-11-25 17:05:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 258 proven. 192 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-25 17:05:41,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:41,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765806468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:41,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:05:41,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 40] total 50 [2022-11-25 17:05:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538341230] [2022-11-25 17:05:41,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:41,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 17:05:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 17:05:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2374, Unknown=0, NotChecked=0, Total=2550 [2022-11-25 17:05:41,430 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 50 states, 48 states have (on average 2.2083333333333335) internal successors, (106), 47 states have internal predecessors, (106), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:05:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:52,458 INFO L93 Difference]: Finished difference Result 295 states and 350 transitions. [2022-11-25 17:05:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-25 17:05:52,459 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2083333333333335) internal successors, (106), 47 states have internal predecessors, (106), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 106 [2022-11-25 17:05:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:52,462 INFO L225 Difference]: With dead ends: 295 [2022-11-25 17:05:52,462 INFO L226 Difference]: Without dead ends: 205 [2022-11-25 17:05:52,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4001 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=959, Invalid=12151, Unknown=0, NotChecked=0, Total=13110 [2022-11-25 17:05:52,469 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 150 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:52,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 481 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 17:05:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-25 17:05:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 136. [2022-11-25 17:05:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 128 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-25 17:05:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2022-11-25 17:05:52,499 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 106 [2022-11-25 17:05:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:52,500 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2022-11-25 17:05:52,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2083333333333335) internal successors, (106), 47 states have internal predecessors, (106), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:05:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2022-11-25 17:05:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-25 17:05:52,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:52,504 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:52,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:52,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 17:05:52,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1737382458, now seen corresponding path program 1 times [2022-11-25 17:05:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:52,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69453987] [2022-11-25 17:05:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:56,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:05:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:05:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:05:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 114 proven. 347 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 17:05:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:58,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69453987] [2022-11-25 17:05:58,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69453987] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:58,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067803987] [2022-11-25 17:05:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:58,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:58,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:58,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:58,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d253e11-b11f-47fa-bb16-3f25b522962b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:05:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:58,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-25 17:05:58,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:58,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:06:00,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:00,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:06:00,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 70 [2022-11-25 17:06:01,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:06:01,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:06:01,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 72 [2022-11-25 17:06:01,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:06:01,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 62 [2022-11-25 17:06:01,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:06:01,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:01,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:06:01,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 62 [2022-11-25 17:06:02,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:06:02,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:06:02,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:06:02,193 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-25 17:06:02,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 55 [2022-11-25 17:06:02,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:06:02,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:06:02,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2022-11-25 17:06:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 8 proven. 468 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 17:06:03,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 152 proven. 296 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-25 17:06:15,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067803987] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:15,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:06:15,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 44, 37] total 103 [2022-11-25 17:06:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739634286] [2022-11-25 17:06:15,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-11-25 17:06:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-11-25 17:06:15,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=9923, Unknown=2, NotChecked=0, Total=10506 [2022-11-25 17:06:15,245 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand has 103 states, 100 states have (on average 2.03) internal successors, (203), 99 states have internal predecessors, (203), 8 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 17:09:01,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:03,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:05,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:07,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:11,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:13,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:15,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:17,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:19,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:21,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:23,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:25,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:27,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:29,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:31,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:33,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:35,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:37,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:39,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:41,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:43,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:45,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:48,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:50,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:52,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:54,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:56,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:09:58,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:00,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:02,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:04,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:06,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:08,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:10,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:12,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:14,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:16,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:18,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:20,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:22,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:24,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:26,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:28,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:32,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:34,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:57,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:10:59,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:01,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:03,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:05,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:07,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:09,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:11,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:13,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:15,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:17,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:19,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:21,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:23,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:25,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:27,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:29,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:31,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:33,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:35,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:37,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:39,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:41,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:43,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:45,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:47,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:49,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:51,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:53,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:55,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:57,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:11:59,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:01,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:03,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:05,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:07,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:09,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:11,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:13,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:15,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:17,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:19,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:21,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:23,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:25,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse7 (+ .cse8 |c_ULTIMATE.start_main_~#x~0#1.offset| 12)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse3 (+ .cse8 |c_ULTIMATE.start_main_~#x~0#1.offset|)) (.cse4 (+ .cse8 |c_ULTIMATE.start_main_~#x~0#1.offset| 4)) (.cse5 (+ .cse8 |c_ULTIMATE.start_main_~#x~0#1.offset| 8)) (.cse9 (select .cse2 (+ 16 |c_ULTIMATE.start_main_~#x~0#1.offset|))) (.cse6 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 12))) (and (or (not (let ((.cse0 (select |c_#memory_int| |c_max_#in~x.base|))) (< (select .cse0 (+ 16 |c_max_#in~x.offset|)) (+ (select .cse0 (+ |c_max_#in~x.offset| 12)) 1)))) (< (select (select |c_#memory_int| c_max_~x.base) (+ (* c_max_~i~0 4) c_max_~x.offset 4)) (+ |c_max_#t~ite4| 1))) (< 3 |c_ULTIMATE.start_main_~i~1#1|) (<= (+ |c_ULTIMATE.start_main_~temp~0#1| 1) .cse1) (exists ((max_~i~0 Int)) (and (<= max_~i~0 4) (<= (+ |c_ULTIMATE.start_main_~temp~0#1| 3) (select .cse2 (+ (* max_~i~0 4) |c_ULTIMATE.start_main_~#x~0#1.offset|))) (<= 4 max_~i~0))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store .cse2 .cse3 v_ArrVal_319) .cse4 v_ArrVal_321) .cse5 v_ArrVal_323) .cse6) 1)) (not (<= (select .cse2 .cse7) v_ArrVal_323)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int) (v_ArrVal_316 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store (store .cse2 .cse3 v_ArrVal_316) .cse4 v_ArrVal_319) .cse5 v_ArrVal_321) .cse7 v_ArrVal_323) .cse6) 1)) (not (<= (select .cse2 (+ .cse8 16 |c_ULTIMATE.start_main_~#x~0#1.offset|)) v_ArrVal_323)))) (< .cse1 (+ 1 .cse9)) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store .cse2 .cse3 v_ArrVal_321) .cse4 v_ArrVal_323) .cse6) 1)) (not (<= (select .cse2 .cse5) v_ArrVal_323)))) (<= .cse9 (select .cse2 .cse6)) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false [2022-11-25 17:12:27,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:29,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:31,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:33,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:35,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:38,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:48,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:53,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:55,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:57,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:12:59,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:13:28,583 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 74 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:13:30,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:32,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:34,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:36,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:38,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:40,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:42,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:44,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:46,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:14:48,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:14:50,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:14:52,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:54,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:14:56,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:58,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:00,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:02,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse5 (+ .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset| 12)) (.cse1 (+ .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset|)) (.cse2 (+ .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset| 4)) (.cse3 (+ .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset| 8)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 12))) (and (<= (+ |c_ULTIMATE.start_main_~temp~0#1| 1) (select .cse0 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 4))) (exists ((max_~i~0 Int)) (and (<= max_~i~0 4) (<= (+ |c_ULTIMATE.start_main_~temp~0#1| 3) (select .cse0 (+ (* max_~i~0 4) |c_ULTIMATE.start_main_~#x~0#1.offset|))) (<= 4 max_~i~0))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store .cse0 .cse1 v_ArrVal_319) .cse2 v_ArrVal_321) .cse3 v_ArrVal_323) .cse4) 1)) (not (<= (select .cse0 .cse5) v_ArrVal_323)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int) (v_ArrVal_316 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store (store .cse0 .cse1 v_ArrVal_316) .cse2 v_ArrVal_319) .cse3 v_ArrVal_321) .cse5 v_ArrVal_323) .cse4) 1)) (not (<= (select .cse0 (+ .cse6 16 |c_ULTIMATE.start_main_~#x~0#1.offset|)) v_ArrVal_323)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store .cse0 .cse1 v_ArrVal_321) .cse2 v_ArrVal_323) .cse4) 1)) (not (<= (select .cse0 .cse3) v_ArrVal_323)))) (<= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~#x~0#1.offset|)) (select .cse0 .cse4)) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false [2022-11-25 17:15:07,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:09,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:16:07,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:16:27,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:16:29,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:16:39,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:16:42,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:16:44,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:15,251 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 76 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:17:17,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:19,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:21,367 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 12)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse9 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse8 (+ .cse9 |c_ULTIMATE.start_main_~#x~0#1.offset| 12)) (.cse5 (+ .cse9 |c_ULTIMATE.start_main_~#x~0#1.offset|)) (.cse4 (+ .cse9 |c_ULTIMATE.start_main_~#x~0#1.offset| 4)) (.cse7 (+ .cse9 |c_ULTIMATE.start_main_~#x~0#1.offset| 8)) (.cse1 (select .cse3 (+ 16 |c_ULTIMATE.start_main_~#x~0#1.offset|))) (.cse2 (select .cse3 .cse6)) (.cse0 (select .cse3 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 4)))) (and (< 3 |c_ULTIMATE.start_main_~i~1#1|) (<= (+ |c_ULTIMATE.start_main_~temp~0#1| 1) .cse0) (<= (+ 3 .cse1) .cse2) (forall ((v_ArrVal_323 Int)) (or (not (<= (select .cse3 .cse4) v_ArrVal_323)) (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store .cse3 .cse5 v_ArrVal_323) .cse6) 1)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store .cse3 .cse5 v_ArrVal_319) .cse4 v_ArrVal_321) .cse7 v_ArrVal_323) .cse6) 1)) (not (<= (select .cse3 .cse8) v_ArrVal_323)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int) (v_ArrVal_316 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store (store .cse3 .cse5 v_ArrVal_316) .cse4 v_ArrVal_319) .cse7 v_ArrVal_321) .cse8 v_ArrVal_323) .cse6) 1)) (not (<= (select .cse3 (+ .cse9 16 |c_ULTIMATE.start_main_~#x~0#1.offset|)) v_ArrVal_323)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store .cse3 .cse5 v_ArrVal_321) .cse4 v_ArrVal_323) .cse6) 1)) (not (<= (select .cse3 .cse7) v_ArrVal_323)))) (<= (+ 1 .cse1) .cse0) (< |c_ULTIMATE.start_main_~temp~0#1| (+ .cse2 1)) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (<= (+ 1 .cse0) (select .cse3 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false [2022-11-25 17:17:23,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:25,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:27,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:29,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:31,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:36,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:17:38,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:17:46,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:31,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:33,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:35,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:37,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:18:39,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:41,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:19:10,465 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 69 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:19:12,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:19:14,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:19:16,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:19:18,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse2 (+ .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset|)) (.cse3 (+ .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~#x~0#1.offset| 12)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse4 (+ .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset| 8))) (and (< (select .cse0 (+ 16 |c_ULTIMATE.start_main_~#x~0#1.offset|)) (+ (select .cse0 .cse1) 1)) (< 3 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int) (v_ArrVal_316 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store (store (store .cse0 .cse2 v_ArrVal_316) .cse3 v_ArrVal_319) .cse4 v_ArrVal_321) (+ .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset| 12) v_ArrVal_323) .cse1) 1)) (not (<= (select .cse0 (+ .cse5 16 |c_ULTIMATE.start_main_~#x~0#1.offset|)) v_ArrVal_323)))) (forall ((v_ArrVal_323 Int) (v_ArrVal_321 Int)) (or (< |c_ULTIMATE.start_main_~temp~0#1| (+ (select (store (store .cse0 .cse2 v_ArrVal_321) .cse3 v_ArrVal_323) .cse1) 1)) (not (<= (select .cse0 .cse4) v_ArrVal_323)))) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false [2022-11-25 17:19:29,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:19:31,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:04,481 WARN L233 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 84 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:20:06,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:08,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:10,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:12,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]