./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/conda.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/conda.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8 --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 4382625030c70271d5cb32641146c4ec68928c0500a545b71e51fae395fc6041 --- 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-2329fc7 [2022-12-13 15:56:02,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:56:02,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:56:02,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:56:02,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:56:02,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:56:02,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:56:02,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:56:02,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:56:02,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:56:02,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:56:02,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:56:02,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:56:02,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:56:02,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:56:02,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:56:02,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:56:02,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:56:02,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:56:02,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:56:02,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:56:02,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:56:02,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:56:02,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:56:02,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:56:02,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:56:02,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:56:02,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:56:02,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:56:02,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:56:02,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:56:02,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:56:02,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:56:02,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:56:02,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:56:02,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:56:02,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:56:02,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:56:02,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:56:02,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:56:02,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:56:02,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 15:56:02,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:56:02,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:56:02,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:56:02,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:56:02,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:56:02,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:56:02,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:56:02,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:56:02,460 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:56:02,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:56:02,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:56:02,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:56:02,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:56:02,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:56:02,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:56:02,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:56:02,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:56:02,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:56:02,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:56:02,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:56:02,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:56:02,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:56:02,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:56:02,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:56:02,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:56:02,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:56:02,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:56:02,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:56:02,465 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:56:02,465 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_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/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_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8 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 -> 4382625030c70271d5cb32641146c4ec68928c0500a545b71e51fae395fc6041 [2022-12-13 15:56:02,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:56:02,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:56:02,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:56:02,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:56:02,654 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:56:02,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/conda.c [2022-12-13 15:56:05,161 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:56:05,332 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:56:05,332 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/sv-benchmarks/c/array-fpi/conda.c [2022-12-13 15:56:05,338 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/data/df8f42a8c/5e35aae8d645439f95fc705f4a6f5048/FLAG3e525f32b [2022-12-13 15:56:05,755 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/data/df8f42a8c/5e35aae8d645439f95fc705f4a6f5048 [2022-12-13 15:56:05,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:56:05,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:56:05,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:56:05,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:56:05,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:56:05,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6f9688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05, skipping insertion in model container [2022-12-13 15:56:05,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:56:05,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:56:05,891 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_3909ec0e-18de-4cf7-919d-1a8a77e11068/sv-benchmarks/c/array-fpi/conda.c[588,601] [2022-12-13 15:56:05,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:56:05,911 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:56:05,920 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_3909ec0e-18de-4cf7-919d-1a8a77e11068/sv-benchmarks/c/array-fpi/conda.c[588,601] [2022-12-13 15:56:05,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:56:05,936 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:56:05,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05 WrapperNode [2022-12-13 15:56:05,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:56:05,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:56:05,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:56:05,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:56:05,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,961 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-12-13 15:56:05,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:56:05,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:56:05,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:56:05,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:56:05,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,977 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:56:05,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:56:05,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:56:05,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:56:05,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (1/1) ... [2022-12-13 15:56:05,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:56:05,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:56:06,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:56:06,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:56:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:56:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:56:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:56:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:56:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 15:56:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:56:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:56:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:56:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:56:06,099 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:56:06,101 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:56:06,207 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:56:06,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:56:06,212 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 15:56:06,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:56:06 BoogieIcfgContainer [2022-12-13 15:56:06,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:56:06,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:56:06,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:56:06,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:56:06,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:56:05" (1/3) ... [2022-12-13 15:56:06,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449fc906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:56:06, skipping insertion in model container [2022-12-13 15:56:06,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:56:05" (2/3) ... [2022-12-13 15:56:06,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449fc906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:56:06, skipping insertion in model container [2022-12-13 15:56:06,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:56:06" (3/3) ... [2022-12-13 15:56:06,220 INFO L112 eAbstractionObserver]: Analyzing ICFG conda.c [2022-12-13 15:56:06,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:56:06,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 15:56:06,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:56:06,288 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;@204dc4fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:56:06,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 15:56:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 15:56:06,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:06,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:06,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-12-13 15:56:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:06,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750529924] [2022-12-13 15:56:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:06,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750529924] [2022-12-13 15:56:06,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750529924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:56:06,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:56:06,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:56:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65207541] [2022-12-13 15:56:06,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:56:06,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:56:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:56:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:56:06,456 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:56:06,468 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-12-13 15:56:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:56:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 15:56:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:56:06,476 INFO L225 Difference]: With dead ends: 40 [2022-12-13 15:56:06,476 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 15:56:06,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:56:06,480 INFO L413 NwaCegarLoop]: 26 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, 26 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-12-13 15:56:06,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:56:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 15:56:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 15:56:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 15:56:06,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-12-13 15:56:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:56:06,505 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 15:56:06,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 15:56:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 15:56:06,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:06,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:06,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:56:06,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-12-13 15:56:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:06,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46239043] [2022-12-13 15:56:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:06,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46239043] [2022-12-13 15:56:06,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46239043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:56:06,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:56:06,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:56:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271311074] [2022-12-13 15:56:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:56:06,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:56:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:56:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:56:06,616 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:56:06,674 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-12-13 15:56:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:56:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 15:56:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:56:06,675 INFO L225 Difference]: With dead ends: 36 [2022-12-13 15:56:06,676 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 15:56:06,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:56:06,677 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:56:06,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:56:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 15:56:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 15:56:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-12-13 15:56:06,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-12-13 15:56:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:56:06,684 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-12-13 15:56:06,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-12-13 15:56:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 15:56:06,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:06,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:06,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:56:06,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-12-13 15:56:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:06,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35698438] [2022-12-13 15:56:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:07,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35698438] [2022-12-13 15:56:07,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35698438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:56:07,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532956951] [2022-12-13 15:56:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:07,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:56:07,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:56:07,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 15:56:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:07,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 15:56:07,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:56:07,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2022-12-13 15:56:07,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 15:56:07,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:56:07,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 15:56:07,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-13 15:56:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:08,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:56:08,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:56:08,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-12-13 15:56:08,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:56:08,369 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-13 15:56:08,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:56:08,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 14 [2022-12-13 15:56:08,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 10 [2022-12-13 15:56:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:08,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532956951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:56:08,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:56:08,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-12-13 15:56:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738673910] [2022-12-13 15:56:08,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:56:08,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 15:56:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 15:56:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2022-12-13 15:56:08,394 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:56:09,120 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-12-13 15:56:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 15:56:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 15:56:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:56:09,122 INFO L225 Difference]: With dead ends: 53 [2022-12-13 15:56:09,122 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 15:56:09,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=1401, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 15:56:09,124 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:56:09,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 80 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:56:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 15:56:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-12-13 15:56:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-13 15:56:09,130 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-12-13 15:56:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:56:09,131 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 15:56:09,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-12-13 15:56:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 15:56:09,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:09,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:09,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:56:09,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:09,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-12-13 15:56:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:09,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823929211] [2022-12-13 15:56:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:09,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823929211] [2022-12-13 15:56:09,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823929211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:56:09,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032115136] [2022-12-13 15:56:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:09,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:56:09,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:56:09,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 15:56:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:09,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 15:56:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:56:09,568 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 18 treesize of output 14 [2022-12-13 15:56:09,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-12-13 15:56:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:09,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:56:09,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 14 treesize of output 12 [2022-12-13 15:56:09,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 18 treesize of output 16 [2022-12-13 15:56:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:09,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032115136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:56:09,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:56:09,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 15:56:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351174123] [2022-12-13 15:56:09,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:56:09,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 15:56:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 15:56:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:56:09,630 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:56:09,711 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-12-13 15:56:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:56:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 15:56:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:56:09,712 INFO L225 Difference]: With dead ends: 48 [2022-12-13 15:56:09,712 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 15:56:09,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 15:56:09,714 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:56:09,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:56:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 15:56:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-12-13 15:56:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-13 15:56:09,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-12-13 15:56:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:56:09,724 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-13 15:56:09,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-13 15:56:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 15:56:09,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:09,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:09,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 15:56:09,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-13 15:56:09,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-12-13 15:56:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:09,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554650925] [2022-12-13 15:56:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554650925] [2022-12-13 15:56:10,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554650925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:56:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34281840] [2022-12-13 15:56:10,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:56:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:56:10,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:56:10,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 15:56:10,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:56:10,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:56:10,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:56:10,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:56:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:10,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:56:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:10,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34281840] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:56:10,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:56:10,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 15:56:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447737940] [2022-12-13 15:56:10,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:56:10,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:56:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:56:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:56:10,227 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:56:10,323 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-12-13 15:56:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:56:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 15:56:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:56:10,325 INFO L225 Difference]: With dead ends: 70 [2022-12-13 15:56:10,325 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 15:56:10,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:56:10,326 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:56:10,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 27 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:56:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 15:56:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-12-13 15:56:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-13 15:56:10,335 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-12-13 15:56:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:56:10,335 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-13 15:56:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-13 15:56:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 15:56:10,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:10,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:10,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 15:56:10,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:10,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:10,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-12-13 15:56:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:10,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163889824] [2022-12-13 15:56:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:10,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163889824] [2022-12-13 15:56:10,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163889824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:56:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108012130] [2022-12-13 15:56:10,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:56:10,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:56:10,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:56:10,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 15:56:10,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 15:56:10,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:56:10,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:56:10,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:56:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:10,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:56:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 15:56:10,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108012130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:56:10,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:56:10,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 15:56:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728352840] [2022-12-13 15:56:10,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:56:10,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:56:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:56:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:56:10,745 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:56:10,825 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-12-13 15:56:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:56:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 15:56:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:56:10,826 INFO L225 Difference]: With dead ends: 39 [2022-12-13 15:56:10,826 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 15:56:10,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 15:56:10,827 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:56:10,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:56:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 15:56:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-12-13 15:56:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-13 15:56:10,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-12-13 15:56:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:56:10,834 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-13 15:56:10,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:56:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-13 15:56:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:56:10,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:56:10,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:56:10,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 15:56:11,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:11,036 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:56:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:56:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-12-13 15:56:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:56:11,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162301714] [2022-12-13 15:56:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:56:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:56:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:56:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:56:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162301714] [2022-12-13 15:56:12,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162301714] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:56:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839604400] [2022-12-13 15:56:12,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:56:12,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:56:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:56:12,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:56:12,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 15:56:12,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:56:12,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:56:12,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 15:56:12,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:56:12,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2022-12-13 15:56:12,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 15:56:12,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:56:12,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:56:12,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 15:56:12,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:56:12,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-12-13 15:56:12,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:56:12,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 40 [2022-12-13 15:56:12,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-12-13 15:56:12,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2022-12-13 15:56:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:12,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:56:13,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:56:13,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-12-13 15:56:21,961 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:56:33,950 WARN L233 SmtUtils]: Spent 11.67s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:56:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:56:34,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839604400] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:56:34,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:56:34,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 48 [2022-12-13 15:56:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334131069] [2022-12-13 15:56:34,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:56:34,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-13 15:56:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:56:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-13 15:56:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-12-13 15:56:34,055 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:18,294 WARN L233 SmtUtils]: Spent 24.97s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:57:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:57:37,969 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2022-12-13 15:57:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 15:57:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 15:57:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:57:37,969 INFO L225 Difference]: With dead ends: 91 [2022-12-13 15:57:37,969 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 15:57:37,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 80.0s TimeCoverageRelationStatistics Valid=882, Invalid=4969, Unknown=1, NotChecked=0, Total=5852 [2022-12-13 15:57:37,971 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:57:37,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 117 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-12-13 15:57:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 15:57:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2022-12-13 15:57:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-12-13 15:57:37,978 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2022-12-13 15:57:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:57:37,978 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-12-13 15:57:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-12-13 15:57:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:57:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:57:37,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:57:37,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 15:57:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:57:38,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:57:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:57:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-12-13 15:57:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:57:38,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706291964] [2022-12-13 15:57:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:57:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:57:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:57:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 15:57:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:57:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706291964] [2022-12-13 15:57:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706291964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:57:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848143798] [2022-12-13 15:57:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:57:39,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:57:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:57:39,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:57:39,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 15:57:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:57:39,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 15:57:39,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:57:39,344 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 15 treesize of output 11 [2022-12-13 15:57:39,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:57:39,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 15:57:39,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-12-13 15:57:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 15:57:39,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:57:40,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 14 [2022-12-13 15:57:40,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 16 [2022-12-13 15:57:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 15:57:40,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848143798] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:57:40,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:57:40,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-12-13 15:57:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637256409] [2022-12-13 15:57:40,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:57:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 15:57:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:57:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 15:57:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:57:40,313 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:57:41,438 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-12-13 15:57:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:57:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 15:57:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:57:41,440 INFO L225 Difference]: With dead ends: 74 [2022-12-13 15:57:41,440 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 15:57:41,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 15:57:41,441 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:57:41,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 15:57:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 15:57:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-12-13 15:57:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-12-13 15:57:41,451 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 27 [2022-12-13 15:57:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:57:41,451 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-12-13 15:57:41,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-12-13 15:57:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 15:57:41,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:57:41,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:57:41,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 15:57:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 15:57:41,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:57:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:57:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-12-13 15:57:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:57:41,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797422836] [2022-12-13 15:57:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:57:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:57:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:57:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:57:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:57:42,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797422836] [2022-12-13 15:57:42,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797422836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:57:42,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510985437] [2022-12-13 15:57:42,078 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:57:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:57:42,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:57:42,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:57:42,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 15:57:42,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 15:57:42,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:57:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:57:42,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:57:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:57:42,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:57:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:57:43,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510985437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:57:43,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:57:43,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 15:57:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550157546] [2022-12-13 15:57:43,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:57:43,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 15:57:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:57:43,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 15:57:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:57:43,250 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:57:44,292 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-12-13 15:57:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:57:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 15:57:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:57:44,293 INFO L225 Difference]: With dead ends: 86 [2022-12-13 15:57:44,293 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 15:57:44,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 15:57:44,294 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:57:44,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 29 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 15:57:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 15:57:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-12-13 15:57:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-12-13 15:57:44,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-12-13 15:57:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:57:44,304 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-12-13 15:57:44,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-12-13 15:57:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 15:57:44,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:57:44,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:57:44,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 15:57:44,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:57:44,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:57:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:57:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-12-13 15:57:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:57:44,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043006502] [2022-12-13 15:57:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:57:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:57:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:57:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 15:57:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:57:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043006502] [2022-12-13 15:57:44,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043006502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:57:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733160181] [2022-12-13 15:57:44,999 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 15:57:45,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:57:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:57:45,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:57:45,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 15:57:45,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 15:57:45,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:57:45,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:57:45,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:57:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:57:45,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:57:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:57:46,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733160181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:57:46,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:57:46,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 15:57:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858382625] [2022-12-13 15:57:46,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:57:46,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 15:57:46,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:57:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 15:57:46,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:57:46,309 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:57:47,505 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-12-13 15:57:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:57:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 15:57:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:57:47,506 INFO L225 Difference]: With dead ends: 48 [2022-12-13 15:57:47,506 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 15:57:47,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-12-13 15:57:47,507 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 15:57:47,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 21 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 15:57:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 15:57:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-13 15:57:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-12-13 15:57:47,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-12-13 15:57:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:57:47,515 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 15:57:47,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:57:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-12-13 15:57:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 15:57:47,516 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:57:47,516 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:57:47,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 15:57:47,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 15:57:47,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:57:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:57:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-12-13 15:57:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:57:47,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200677279] [2022-12-13 15:57:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:57:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:57:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:57:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:57:56,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:57:56,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200677279] [2022-12-13 15:57:56,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200677279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:57:56,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236060255] [2022-12-13 15:57:56,892 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 15:57:56,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:57:56,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:57:56,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:57:56,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 15:57:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:57:56,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 15:57:56,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:57:57,004 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 11 treesize of output 7 [2022-12-13 15:57:57,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2022-12-13 15:57:57,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:57:57,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:57:58,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:57:59,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 15:58:00,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:00,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-12-13 15:58:01,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:01,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 73 [2022-12-13 15:58:03,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:58:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:03,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:03,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 77 [2022-12-13 15:58:04,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:04,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:04,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:58:04,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 69 [2022-12-13 15:58:05,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 55 [2022-12-13 15:58:06,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 46 [2022-12-13 15:58:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:06,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:58:18,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:58:18,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-12-13 15:58:20,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 2)) (not (= (select v_arrayElimArr_4 .cse1) 2)) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5))))) (+ .cse7 3)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (not (= (select v_arrayElimArr_4 .cse1) 2)) (< (+ .cse7 1) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12)))))) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-12-13 15:58:23,461 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 5)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-12-13 15:58:26,229 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 5) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 7)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-12-13 15:58:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 15:58:26,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236060255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:58:26,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:58:26,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 65 [2022-12-13 15:58:26,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372685522] [2022-12-13 15:58:26,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:58:26,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 15:58:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:26,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 15:58:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3320, Unknown=3, NotChecked=366, Total=4160 [2022-12-13 15:58:26,439 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:30,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse9 .cse8)) (.cse0 (select .cse9 .cse7)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 1)) .cse8 (+ .cse1 1)) .cse7 (+ .cse0 1))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6 1)))))) (not (= .cse6 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse10 5) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15)))))) (not (= .cse11 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (not (= 2 (select v_arrayElimArr_4 .cse7)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse16 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (< (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse19 .cse20))))) (+ .cse10 7)) (not (= 2 (select v_arrayElimArr_4 .cse7)))))))) is different from false [2022-12-13 15:58:32,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 5)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (select .cse20 .cse7)) (.cse13 (select .cse20 .cse6)) (.cse19 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse13 1)) (not (= .cse14 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse19 1)) .cse7 (+ .cse14 1)) .cse6 (+ .cse13 1))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse18 .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse18 .cse19 1)))))) (not (= .cse19 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-12-13 15:58:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:56,689 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-12-13 15:58:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 15:58:56,691 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 15:58:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:56,691 INFO L225 Difference]: With dead ends: 82 [2022-12-13 15:58:56,691 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 15:58:56,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=636, Invalid=4349, Unknown=5, NotChecked=710, Total=5700 [2022-12-13 15:58:56,693 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:56,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 191 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1067 Invalid, 0 Unknown, 152 Unchecked, 9.1s Time] [2022-12-13 15:58:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 15:58:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2022-12-13 15:58:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-13 15:58:56,705 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2022-12-13 15:58:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:56,705 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-13 15:58:56,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-13 15:58:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 15:58:56,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:56,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:56,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 15:58:56,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 15:58:56,907 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:58:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-12-13 15:58:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107529225] [2022-12-13 15:58:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 15:58:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107529225] [2022-12-13 15:58:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107529225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:58:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123493661] [2022-12-13 15:58:58,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:58:58,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:58:58,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:58:58,319 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:58:58,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 15:58:58,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:58:58,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:58:58,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 15:58:58,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:58:58,906 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-12-13 15:58:59,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:59,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 15:58:59,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:58:59,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 15:58:59,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-12-13 15:59:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 15:59:00,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:59:00,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 14 [2022-12-13 15:59:00,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 16 [2022-12-13 15:59:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 15:59:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123493661] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:59:01,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:59:01,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-12-13 15:59:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010439007] [2022-12-13 15:59:01,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:59:01,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 15:59:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:59:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 15:59:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-12-13 15:59:01,093 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:59:04,694 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-12-13 15:59:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 15:59:04,695 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 15:59:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:59:04,695 INFO L225 Difference]: With dead ends: 76 [2022-12-13 15:59:04,695 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 15:59:04,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 15:59:04,696 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:59:04,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 15:59:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 15:59:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-12-13 15:59:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-12-13 15:59:04,708 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2022-12-13 15:59:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:59:04,708 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-12-13 15:59:04,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-12-13 15:59:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 15:59:04,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:59:04,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:59:04,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 15:59:04,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 15:59:04,910 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:59:04,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:59:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-12-13 15:59:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:59:04,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798525196] [2022-12-13 15:59:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:59:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:59:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:59:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 15:59:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:59:05,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798525196] [2022-12-13 15:59:05,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798525196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:59:05,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354819557] [2022-12-13 15:59:05,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:59:05,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:59:05,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:59:05,520 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:59:05,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 15:59:05,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:59:05,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:59:05,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 15:59:05,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:59:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 15:59:06,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:59:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 15:59:07,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354819557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:59:07,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:59:07,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 15:59:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569129943] [2022-12-13 15:59:07,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:59:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 15:59:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:59:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 15:59:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 15:59:07,214 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:59:08,436 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-12-13 15:59:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 15:59:08,437 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 15:59:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:59:08,438 INFO L225 Difference]: With dead ends: 102 [2022-12-13 15:59:08,438 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 15:59:08,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-12-13 15:59:08,439 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 15:59:08,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 34 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 15:59:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 15:59:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-12-13 15:59:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-13 15:59:08,452 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-12-13 15:59:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:59:08,452 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-13 15:59:08,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-13 15:59:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 15:59:08,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:59:08,453 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:59:08,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 15:59:08,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 15:59:08,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:59:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:59:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-12-13 15:59:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:59:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584977926] [2022-12-13 15:59:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:59:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:59:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:59:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 15:59:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:59:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584977926] [2022-12-13 15:59:09,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584977926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:59:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54686286] [2022-12-13 15:59:09,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:59:09,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:59:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:59:09,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:59:09,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 15:59:09,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 15:59:09,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:59:09,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 15:59:09,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:59:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 15:59:10,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:59:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 15:59:10,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54686286] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:59:10,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:59:10,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 15:59:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539377624] [2022-12-13 15:59:10,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:59:10,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 15:59:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:59:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 15:59:10,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 15:59:10,979 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:59:12,697 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-13 15:59:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:59:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 15:59:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:59:12,698 INFO L225 Difference]: With dead ends: 57 [2022-12-13 15:59:12,699 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 15:59:12,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-12-13 15:59:12,699 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:59:12,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 15:59:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 15:59:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-12-13 15:59:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-12-13 15:59:12,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-12-13 15:59:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:59:12,708 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-12-13 15:59:12,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:59:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-12-13 15:59:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 15:59:12,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:59:12,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:59:12,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 15:59:12,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:59:12,911 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:59:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:59:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-12-13 15:59:12,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:59:12,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49844086] [2022-12-13 15:59:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:59:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:59:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:59:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:59:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:59:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49844086] [2022-12-13 15:59:24,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49844086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:59:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339274564] [2022-12-13 15:59:24,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:59:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:59:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:59:24,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:59:24,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3909ec0e-18de-4cf7-919d-1a8a77e11068/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 15:59:24,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:59:24,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:59:24,108 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-13 15:59:24,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:59:24,721 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 11 treesize of output 7 [2022-12-13 15:59:24,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2022-12-13 15:59:25,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:59:25,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:59:26,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:59:26,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:59:29,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 15:59:31,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:31,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:59:31,228 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 15:59:31,229 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 56 treesize of output 42 [2022-12-13 15:59:33,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:33,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:33,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:33,185 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 15:59:33,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 49 [2022-12-13 15:59:35,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:35,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:35,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:35,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:35,164 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 15:59:35,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 61 [2022-12-13 15:59:37,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:59:37,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:37,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:37,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:37,947 INFO L321 Elim1Store]: treesize reduction 59, result has 24.4 percent of original size [2022-12-13 15:59:37,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 67 treesize of output 70 [2022-12-13 15:59:39,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:39,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:39,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:39,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:39,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:59:39,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:39,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:39,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-12-13 15:59:40,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:40,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:40,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:40,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:40,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:59:40,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:59:40,801 INFO L321 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2022-12-13 15:59:40,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 67 treesize of output 70 [2022-12-13 15:59:42,234 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-13 15:59:42,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 63 treesize of output 55 [2022-12-13 15:59:43,055 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 15:59:43,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 42 [2022-12-13 15:59:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:59:43,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:00:16,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:00:16,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-12-13 16:00:33,910 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 16:00:33,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 1 [2022-12-13 16:00:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:00:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339274564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:00:33,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:00:33,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 32] total 92 [2022-12-13 16:00:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363794266] [2022-12-13 16:00:33,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:00:33,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-12-13 16:00:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:00:33,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-12-13 16:00:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=6937, Unknown=1, NotChecked=0, Total=8372 [2022-12-13 16:00:33,920 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:00:55,208 WARN L233 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:02:08,418 WARN L233 SmtUtils]: Spent 41.99s on a formula simplification. DAG size of input: 241 DAG size of output: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:02:49,534 WARN L233 SmtUtils]: Spent 31.71s on a formula simplification. DAG size of input: 127 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:02:53,137 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse99 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse96 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse72 (select .cse28 .cse96)) (.cse83 (select .cse28 .cse99)) (.cse73 (+ .cse98 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (select .cse28 .cse73)) (.cse43 (store .cse28 .cse99 (+ .cse83 1))) (.cse97 (+ .cse72 1)) (.cse56 (+ .cse98 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse75 (select .cse28 .cse56)) (.cse95 (store .cse43 .cse96 .cse97)) (.cse74 (+ .cse64 1))) (let ((.cse2 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (store .cse28 .cse96 .cse97)) (.cse20 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse71 (store .cse95 .cse73 .cse74)) (.cse57 (+ .cse75 1)) (.cse44 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (* c_~N~0 2)) (.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (= .cse5 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse95))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse90 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse94 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse89 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse89 .cse90 .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse94)))))))) (.cse46 (<= (mod c_~N~0 4294967296) 536870911)) (.cse3 (not .cse44)) (.cse16 (< 4 c_~N~0)) (.cse17 (not (< 3 c_~N~0))) (.cse19 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse13) 2)) (not (= 2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select v_arrayElimArr_5 .cse14) 2)) (not (= 2 (select v_arrayElimArr_5 .cse12))) (= .cse5 (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 2 .cse87 .cse88)))))))))) (.cse45 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse1 (not (= .cse83 1))) (.cse31 (= .cse5 (let ((.cse82 (store .cse71 .cse56 .cse57))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse80 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse81 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse79 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse79 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse78 .cse79 .cse80 .cse81))))))))) (.cse34 (not .cse20)) (.cse35 (not (= .cse75 1))) (.cse36 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (.cse55 (store .cse15 .cse73 .cse74)) (.cse0 (not (= .cse72 1))) (.cse47 (= .cse5 (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse70 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse69 .cse70)))))))) (.cse32 (not (= .cse64 1))) (.cse18 (not .cse2)) (.cse33 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse3 (= .cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse9 .cse10 .cse11)))))))) (or .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (select .cse28 .cse13)) (.cse29 (select .cse28 .cse14)) (.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse28 .cse12))) (or (not (= .cse21 1)) (= .cse5 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse26 1)) .cse14 (+ .cse29 1)) .cse13 (+ .cse21 1)) .cse12 (+ .cse30 1))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse25 .cse26 1 .cse27))))))) (not (= .cse29 1)) .cse16 .cse17 (not (= .cse26 1)) (not (= .cse30 1)))) (or .cse0 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse2 .cse33 .cse3 .cse4) (or .cse16 .cse17 .cse19 .cse34 .cse36) (or .cse1 (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse42 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse39 .cse40 .cse41 .cse42)))))) .cse5) .cse44 .cse45) .cse46 (or .cse0 .cse1 .cse47 .cse32 .cse18 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse46) (and (not .cse46) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse0 (= .cse5 (let ((.cse54 (store .cse55 .cse56 .cse57))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse52 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse48 .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse52 .cse53)))))))) .cse32 .cse34 .cse35 .cse36) (or .cse16 .cse2 .cse17 .cse19 .cse3) (or .cse44 .cse16 .cse17 .cse19 .cse45) (or .cse0 .cse1 .cse31 .cse32 .cse34 .cse35 .cse36) (or .cse0 (= (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse59 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse58 .cse59 .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse63)))))) .cse5) .cse32 .cse18 .cse20) (or .cse0 .cse47 .cse32 .cse18 .cse33 .cse20))))))))) is different from true [2022-12-13 16:02:55,145 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-12-13 16:02:57,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:03:42,646 WARN L233 SmtUtils]: Spent 40.75s on a formula simplification. DAG size of input: 145 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:03:45,580 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-12-13 16:03:47,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:04:27,337 WARN L233 SmtUtils]: Spent 29.96s on a formula simplification. DAG size of input: 123 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:04:57,030 WARN L233 SmtUtils]: Spent 15.41s on a formula simplification. DAG size of input: 140 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:04:59,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:05:01,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:05:39,521 WARN L233 SmtUtils]: Spent 31.27s on a formula simplification. DAG size of input: 141 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:05:57,251 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-12-13 16:05:59,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:06:26,370 WARN L233 SmtUtils]: Spent 21.63s on a formula simplification. DAG size of input: 119 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:06:33,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:06:55,706 WARN L233 SmtUtils]: Spent 17.46s on a formula simplification. DAG size of input: 137 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:07:20,582 WARN L233 SmtUtils]: Spent 13.73s on a formula simplification. DAG size of input: 134 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:07:22,921 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-12-13 16:07:37,864 WARN L233 SmtUtils]: Spent 9.69s on a formula simplification. DAG size of input: 115 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:07:52,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:08:29,723 WARN L233 SmtUtils]: Spent 9.96s on a formula simplification. DAG size of input: 128 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:08:51,852 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse89 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse90 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse86 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse87 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse62 (select .cse86 .cse87)) (.cse73 (select .cse86 .cse90)) (.cse63 (+ .cse89 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (select .cse86 .cse63)) (.cse33 (store .cse86 .cse90 (+ .cse73 1))) (.cse88 (+ .cse62 1)) (.cse46 (+ .cse89 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select .cse86 .cse46)) (.cse85 (store .cse33 .cse87 .cse88)) (.cse64 (+ .cse54 1))) (let ((.cse2 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (store .cse86 .cse87 .cse88)) (.cse20 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse61 (store .cse85 .cse63 .cse64)) (.cse47 (+ .cse65 1)) (.cse34 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (* c_~N~0 2)) (.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (= .cse5 (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse85))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse84 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse79 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse79 .cse80 .cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse84)))))))) (.cse36 (<= (mod c_~N~0 4294967296) 536870911)) (.cse3 (not .cse34)) (.cse16 (< 4 c_~N~0)) (.cse17 (not (< 3 c_~N~0))) (.cse19 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse13) 2)) (not (= 2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select v_arrayElimArr_5 .cse14) 2)) (not (= 2 (select v_arrayElimArr_5 .cse12))) (= .cse5 (let ((.cse75 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse74 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse74 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 2 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 2 .cse77 .cse78)))))))))) (.cse35 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse1 (not (= .cse73 1))) (.cse21 (= .cse5 (let ((.cse72 (store .cse61 .cse46 .cse47))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse72))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse70 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse71 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse69 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69 .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse68 .cse69 .cse70 .cse71))))))))) (.cse24 (not .cse20)) (.cse25 (not (= .cse65 1))) (.cse26 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (.cse45 (store .cse15 .cse63 .cse64)) (.cse0 (not (= .cse62 1))) (.cse37 (= .cse5 (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse59 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse59 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse55 .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse59 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse59 .cse60)))))))) (.cse22 (not (= .cse54 1))) (.cse18 (not .cse2)) (.cse23 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse3 (= .cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse9 .cse10 .cse11)))))))) (or .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse23 .cse3 .cse4) (or .cse16 .cse17 .cse19 .cse24 .cse26) (or .cse1 (= (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse32 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse29 .cse30 .cse31 .cse32)))))) .cse5) .cse34 .cse35) .cse36 (or .cse0 .cse1 .cse37 .cse22 .cse18 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse36) (and (not .cse36) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse0 (= .cse5 (let ((.cse44 (store .cse45 .cse46 .cse47))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse42 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse38 .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse42 .cse43)))))))) .cse22 .cse24 .cse25 .cse26) (or .cse16 .cse2 .cse17 .cse19 .cse3) (or .cse34 .cse16 .cse17 .cse19 .cse35) (or .cse0 .cse1 .cse21 .cse22 .cse24 .cse25 .cse26) (or .cse0 (= (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse48 .cse49 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse53)))))) .cse5) .cse22 .cse18 .cse20) (or .cse0 .cse37 .cse22 .cse18 .cse23 .cse20))))))))) is different from true [2022-12-13 16:09:07,699 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 120 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:10:18,745 WARN L233 SmtUtils]: Spent 57.87s on a formula simplification. DAG size of input: 261 DAG size of output: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)