./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:38:59,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:38:59,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:39:00,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:39:00,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:39:00,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:39:00,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:39:00,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:39:00,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:39:00,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:39:00,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:39:00,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:39:00,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:39:00,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:39:00,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:39:00,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:39:00,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:39:00,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:39:00,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:39:00,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:39:00,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:39:00,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:39:00,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:39:00,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:39:00,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:39:00,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:39:00,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:39:00,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:39:00,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:39:00,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:39:00,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:39:00,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:39:00,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:39:00,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:39:00,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:39:00,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:39:00,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:39:00,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:39:00,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:39:00,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:39:00,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:39:00,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:39:00,147 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:39:00,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:39:00,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:39:00,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:39:00,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:39:00,148 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:39:00,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:39:00,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:39:00,149 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:39:00,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:39:00,150 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:39:00,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:39:00,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:39:00,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:39:00,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:39:00,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:39:00,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:39:00,151 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:39:00,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:39:00,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:39:00,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:39:00,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:39:00,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:39:00,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:39:00,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:39:00,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:39:00,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:39:00,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:39:00,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:39:00,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:39:00,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:39:00,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:39:00,154 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:39:00,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:39:00,154 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_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2022-11-25 17:39:00,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:39:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:39:00,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:39:00,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:39:00,526 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:39:00,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loops/eureka_05.i [2022-11-25 17:39:03,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:39:03,767 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:39:03,767 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/sv-benchmarks/c/loops/eureka_05.i [2022-11-25 17:39:03,774 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/data/d95ee52b0/e699849788db40f8883d28408f7ce203/FLAG433feeaa3 [2022-11-25 17:39:03,833 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/data/d95ee52b0/e699849788db40f8883d28408f7ce203 [2022-11-25 17:39:03,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:39:03,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:39:03,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:39:03,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:39:03,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:39:03,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:39:03" (1/1) ... [2022-11-25 17:39:03,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6702df32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:03, skipping insertion in model container [2022-11-25 17:39:03,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:39:03" (1/1) ... [2022-11-25 17:39:03,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:39:03,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:39:04,038 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_491ba1e3-133a-4002-ba5e-644f1cd0e246/sv-benchmarks/c/loops/eureka_05.i[810,823] [2022-11-25 17:39:04,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:39:04,073 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:39:04,085 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_491ba1e3-133a-4002-ba5e-644f1cd0e246/sv-benchmarks/c/loops/eureka_05.i[810,823] [2022-11-25 17:39:04,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:39:04,108 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:39:04,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04 WrapperNode [2022-11-25 17:39:04,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:39:04,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:39:04,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:39:04,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:39:04,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,150 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-11-25 17:39:04,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:39:04,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:39:04,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:39:04,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:39:04,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:39:04,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:39:04,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:39:04,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:39:04,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (1/1) ... [2022-11-25 17:39:04,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:39:04,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:04,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:39:04,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:39:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:39:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:39:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:39:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:39:04,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:39:04,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:39:04,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:39:04,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:39:04,373 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:39:04,376 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:39:04,526 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:39:04,532 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:39:04,532 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 17:39:04,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:39:04 BoogieIcfgContainer [2022-11-25 17:39:04,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:39:04,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:39:04,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:39:04,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:39:04,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:39:03" (1/3) ... [2022-11-25 17:39:04,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46276713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:39:04, skipping insertion in model container [2022-11-25 17:39:04,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:39:04" (2/3) ... [2022-11-25 17:39:04,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46276713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:39:04, skipping insertion in model container [2022-11-25 17:39:04,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:39:04" (3/3) ... [2022-11-25 17:39:04,556 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2022-11-25 17:39:04,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:39:04,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:39:04,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:39:04,637 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;@25aebe35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:39:04,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:39:04,641 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-11-25 17:39:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 17:39:04,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:04,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:04,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2015864939, now seen corresponding path program 1 times [2022-11-25 17:39:04,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:04,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626175343] [2022-11-25 17:39:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:39:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626175343] [2022-11-25 17:39:04,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626175343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:39:04,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:39:04,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:39:04,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327446113] [2022-11-25 17:39:04,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:39:04,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:39:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:05,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:39:05,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:39:05,032 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:05,110 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-11-25 17:39:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:39:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 17:39:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:05,122 INFO L225 Difference]: With dead ends: 42 [2022-11-25 17:39:05,123 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 17:39:05,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:39:05,130 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:05,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:39:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 17:39:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-25 17:39:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-25 17:39:05,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-11-25 17:39:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:05,162 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-25 17:39:05,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-25 17:39:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:39:05,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:05,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:05,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:39:05,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1565230291, now seen corresponding path program 1 times [2022-11-25 17:39:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:05,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363354957] [2022-11-25 17:39:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:39:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:05,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363354957] [2022-11-25 17:39:05,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363354957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800056501] [2022-11-25 17:39:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:05,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:05,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:39:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:05,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:39:05,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:39:05,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:39:05,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800056501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:05,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:05,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-25 17:39:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955184800] [2022-11-25 17:39:05,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:05,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:39:05,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:39:05,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:39:05,417 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:05,493 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-11-25 17:39:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:39:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 17:39:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:05,495 INFO L225 Difference]: With dead ends: 45 [2022-11-25 17:39:05,495 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 17:39:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:39:05,507 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:05,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:39:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 17:39:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-25 17:39:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-25 17:39:05,531 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-11-25 17:39:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:05,531 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-25 17:39:05,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-25 17:39:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:39:05,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:05,533 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:05,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:05,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:05,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash -7962739, now seen corresponding path program 2 times [2022-11-25 17:39:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:05,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045102659] [2022-11-25 17:39:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:05,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:39:05,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:05,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045102659] [2022-11-25 17:39:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045102659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:39:05,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:39:05,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:39:05,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401244336] [2022-11-25 17:39:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:39:05,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:39:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:05,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:39:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:39:05,981 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:06,016 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-25 17:39:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:39:06,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 17:39:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:06,018 INFO L225 Difference]: With dead ends: 38 [2022-11-25 17:39:06,018 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 17:39:06,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-25 17:39:06,020 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:06,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:39:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 17:39:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-11-25 17:39:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-25 17:39:06,028 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2022-11-25 17:39:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:06,029 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-25 17:39:06,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-25 17:39:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:39:06,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:06,031 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:06,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:39:06,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1148715813, now seen corresponding path program 1 times [2022-11-25 17:39:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:06,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669984005] [2022-11-25 17:39:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:39:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:06,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669984005] [2022-11-25 17:39:06,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669984005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:39:06,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:39:06,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:39:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153851774] [2022-11-25 17:39:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:39:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:39:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:39:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:39:06,282 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:06,334 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-11-25 17:39:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:39:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 17:39:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:06,336 INFO L225 Difference]: With dead ends: 47 [2022-11-25 17:39:06,336 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 17:39:06,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:39:06,340 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:39:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 17:39:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-11-25 17:39:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 17:39:06,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-11-25 17:39:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:06,348 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 17:39:06,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 17:39:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:39:06,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:06,349 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:06,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:39:06,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1025080129, now seen corresponding path program 1 times [2022-11-25 17:39:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:06,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671837603] [2022-11-25 17:39:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 17:39:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671837603] [2022-11-25 17:39:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671837603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402271398] [2022-11-25 17:39:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:06,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:06,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:06,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:39:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:06,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:39:06,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:39:06,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:39:06,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402271398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:06,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:06,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2022-11-25 17:39:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834545937] [2022-11-25 17:39:06,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:06,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:39:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:06,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:39:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:39:06,769 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:06,925 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-11-25 17:39:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:39:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 24 [2022-11-25 17:39:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:06,929 INFO L225 Difference]: With dead ends: 80 [2022-11-25 17:39:06,929 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 17:39:06,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:39:06,937 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:06,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 109 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:39:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 17:39:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2022-11-25 17:39:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-25 17:39:06,956 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2022-11-25 17:39:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:06,956 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-25 17:39:06,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-25 17:39:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:39:06,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:06,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:06,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:07,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:07,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2070168231, now seen corresponding path program 2 times [2022-11-25 17:39:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607774016] [2022-11-25 17:39:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 17:39:07,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:07,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607774016] [2022-11-25 17:39:07,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607774016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:07,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843656088] [2022-11-25 17:39:07,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:39:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:07,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:07,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:39:07,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:39:07,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:39:07,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:39:07,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 17:39:07,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 17:39:07,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843656088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:07,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:07,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-25 17:39:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641317210] [2022-11-25 17:39:07,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:07,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:39:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:39:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:39:07,614 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:07,883 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2022-11-25 17:39:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:39:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 17:39:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:07,889 INFO L225 Difference]: With dead ends: 82 [2022-11-25 17:39:07,889 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 17:39:07,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:39:07,891 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 172 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:07,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 76 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:39:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 17:39:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2022-11-25 17:39:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-11-25 17:39:07,934 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 30 [2022-11-25 17:39:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:07,934 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-11-25 17:39:07,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-11-25 17:39:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:39:07,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:07,936 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:07,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:08,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:08,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash 271285953, now seen corresponding path program 3 times [2022-11-25 17:39:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:08,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855975913] [2022-11-25 17:39:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 17:39:08,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:08,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855975913] [2022-11-25 17:39:08,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855975913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:08,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101842912] [2022-11-25 17:39:08,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:39:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:08,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:08,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:39:08,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 17:39:08,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:39:08,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:39:08,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 17:39:08,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 17:39:08,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101842912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:08,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:08,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2022-11-25 17:39:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873189527] [2022-11-25 17:39:08,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:08,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:39:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:39:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:39:08,626 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:08,878 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2022-11-25 17:39:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:39:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 17:39:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:08,884 INFO L225 Difference]: With dead ends: 79 [2022-11-25 17:39:08,884 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 17:39:08,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:39:08,886 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 94 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:08,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 56 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:39:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 17:39:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 17:39:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2022-11-25 17:39:08,917 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 58 [2022-11-25 17:39:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:08,920 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2022-11-25 17:39:08,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-11-25 17:39:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 17:39:08,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:08,927 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:08,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:09,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1550484977, now seen corresponding path program 4 times [2022-11-25 17:39:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:09,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147181420] [2022-11-25 17:39:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 33 proven. 123 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-25 17:39:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147181420] [2022-11-25 17:39:09,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147181420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:09,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845079058] [2022-11-25 17:39:09,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:39:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:09,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:09,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:39:09,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:39:09,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:39:09,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:39:09,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 17:39:09,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 17:39:09,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845079058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:09,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:09,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 13 [2022-11-25 17:39:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10751956] [2022-11-25 17:39:09,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:39:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:39:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:39:09,809 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:10,256 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2022-11-25 17:39:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 17:39:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 66 [2022-11-25 17:39:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:10,257 INFO L225 Difference]: With dead ends: 137 [2022-11-25 17:39:10,257 INFO L226 Difference]: Without dead ends: 113 [2022-11-25 17:39:10,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=804, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 17:39:10,259 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:10,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 111 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:39:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-25 17:39:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2022-11-25 17:39:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2022-11-25 17:39:10,277 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 66 [2022-11-25 17:39:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2022-11-25 17:39:10,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2022-11-25 17:39:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 17:39:10,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:10,279 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:10,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 17:39:10,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 96032675, now seen corresponding path program 5 times [2022-11-25 17:39:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:10,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527868202] [2022-11-25 17:39:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-11-25 17:39:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:11,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527868202] [2022-11-25 17:39:11,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527868202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:11,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60343125] [2022-11-25 17:39:11,301 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:39:11,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:11,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:11,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:11,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:39:11,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-25 17:39:11,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:39:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 17:39:11,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:11,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:39:11,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 44 [2022-11-25 17:39:12,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:39:12,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 17 [2022-11-25 17:39:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 158 proven. 43 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-25 17:39:12,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:13,702 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 139 treesize of output 125 [2022-11-25 17:39:13,822 INFO L321 Elim1Store]: treesize reduction 5, result has 95.9 percent of original size [2022-11-25 17:39:13,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 233 treesize of output 274 [2022-11-25 17:39:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 163 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 17:39:15,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60343125] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:15,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:15,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 18] total 42 [2022-11-25 17:39:15,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299252565] [2022-11-25 17:39:15,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:15,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 17:39:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 17:39:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1560, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 17:39:15,309 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 42 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:37,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:39:39,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:39:48,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:39:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:48,956 INFO L93 Difference]: Finished difference Result 511 states and 684 transitions. [2022-11-25 17:39:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-11-25 17:39:48,957 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 69 [2022-11-25 17:39:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:48,960 INFO L225 Difference]: With dead ends: 511 [2022-11-25 17:39:48,960 INFO L226 Difference]: Without dead ends: 423 [2022-11-25 17:39:48,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12008 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=3866, Invalid=32806, Unknown=0, NotChecked=0, Total=36672 [2022-11-25 17:39:48,972 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 436 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 138 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:48,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 252 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1286 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-11-25 17:39:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-11-25 17:39:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 269. [2022-11-25 17:39:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.3507462686567164) internal successors, (362), 268 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 362 transitions. [2022-11-25 17:39:49,024 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 362 transitions. Word has length 69 [2022-11-25 17:39:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:49,024 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 362 transitions. [2022-11-25 17:39:49,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:39:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 362 transitions. [2022-11-25 17:39:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 17:39:49,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:49,031 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:39:49,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:49,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 962635175, now seen corresponding path program 1 times [2022-11-25 17:39:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:49,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397149977] [2022-11-25 17:39:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 115 proven. 101 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 17:39:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:52,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397149977] [2022-11-25 17:39:52,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397149977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:52,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008987098] [2022-11-25 17:39:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:52,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:52,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:39:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:52,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 17:39:52,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:53,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:39:53,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 44 [2022-11-25 17:39:53,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:39:53,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:39:53,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:39:53,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:39:53,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 53 [2022-11-25 17:39:53,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:39:53,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-11-25 17:39:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 55 proven. 190 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:39:53,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:59,035 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 86 treesize of output 76 [2022-11-25 17:39:59,124 INFO L321 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2022-11-25 17:39:59,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 175 [2022-11-25 17:39:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 148 proven. 53 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-25 17:39:59,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008987098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:59,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:59,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 16] total 60 [2022-11-25 17:39:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705831057] [2022-11-25 17:39:59,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:59,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-25 17:39:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-25 17:39:59,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3292, Unknown=2, NotChecked=0, Total=3540 [2022-11-25 17:39:59,548 INFO L87 Difference]: Start difference. First operand 269 states and 362 transitions. Second operand has 60 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 60 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:17,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse4 (select |c_#memory_int| |c_~#array~0.base|)) (.cse5 (+ .cse8 |c_~#array~0.offset|)) (.cse9 (* |c_ULTIMATE.start_SelectionSort_~rh~0#1| 4)) (.cse10 (* |c_ULTIMATE.start_SelectionSort_~i~0#1| 4))) (let ((.cse6 (+ |c_~#array~0.offset| .cse10)) (.cse2 (+ .cse8 |c_~#array~0.offset| 4)) (.cse3 (+ .cse8 |c_~#array~0.offset| 12)) (.cse7 (+ .cse9 |c_~#array~0.offset|)) (.cse0 (select .cse4 .cse5))) (and (= |c_~#array~0.offset| 0) (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (< v_ArrVal_304 .cse0) (let ((.cse1 (store (store .cse4 .cse5 v_ArrVal_305) .cse6 v_ArrVal_304))) (< (select .cse1 .cse2) (+ (select .cse1 .cse3) 1))))) (< (select .cse4 .cse7) (+ (select .cse4 .cse6) 1)) (or (and (= .cse8 .cse9) (= (+ .cse8 4) .cse10)) (= .cse9 .cse10)) (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (let ((.cse11 (store (store .cse4 .cse5 v_ArrVal_305) .cse7 v_ArrVal_304))) (< (select .cse11 .cse2) (+ (select .cse11 .cse3) 1))) (< v_ArrVal_304 .cse0))))))) is different from false [2022-11-25 17:40:19,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:40:21,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:40:23,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:40:59,297 WARN L233 SmtUtils]: Spent 29.18s on a formula simplification. DAG size of input: 82 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:41:01,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:03,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:05,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:07,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse5 (+ .cse3 |c_~#array~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#array~0.base|))) (let ((.cse7 (select .cse4 (+ 16 |c_~#array~0.offset|))) (.cse2 (+ .cse3 |c_~#array~0.offset| 4)) (.cse6 (+ (* |c_ULTIMATE.start_SelectionSort_~rh~0#1| 4) |c_~#array~0.offset|)) (.cse0 (select .cse4 .cse5))) (and (= 2 |c_ULTIMATE.start_SelectionSort_~lh~0#1|) (= |c_~#array~0.offset| 0) (forall ((v_ArrVal_307 Int) (v_ArrVal_306 Int)) (or (< .cse0 v_ArrVal_306) (let ((.cse1 (store (store .cse4 .cse5 v_ArrVal_307) .cse6 v_ArrVal_306))) (< (select .cse1 .cse2) (+ (select .cse1 (+ .cse3 |c_~#array~0.offset| 8)) 1))))) (<= (+ (select .cse4 (+ |c_~#array~0.offset| 8)) 1) .cse7) (<= (+ (select .cse4 .cse2) 1) .cse7) (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (let ((.cse8 (store (store .cse4 .cse5 v_ArrVal_305) .cse6 v_ArrVal_304))) (< (select .cse8 .cse2) (+ (select .cse8 (+ .cse3 |c_~#array~0.offset| 12)) 1))) (< v_ArrVal_304 .cse0))))))) is different from false [2022-11-25 17:41:09,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:18,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:19,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:40,239 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 67 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:41:43,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:52,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:56,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:41:58,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:42:00,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:42:02,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse6 (+ .cse9 |c_~#array~0.offset|)) (.cse10 (* |c_ULTIMATE.start_SelectionSort_~rh~0#1| 4)) (.cse11 (* |c_ULTIMATE.start_SelectionSort_~i~0#1| 4)) (.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (let ((.cse2 (+ (select .cse0 (+ .cse9 |c_~#array~0.offset| 8)) 1)) (.cse7 (+ |c_~#array~0.offset| .cse11)) (.cse1 (+ .cse9 |c_~#array~0.offset| 4)) (.cse5 (+ .cse9 |c_~#array~0.offset| 12)) (.cse8 (+ .cse10 |c_~#array~0.offset|)) (.cse3 (select .cse0 .cse6))) (and (< (select .cse0 .cse1) .cse2) (< .cse3 .cse2) (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (< v_ArrVal_304 .cse3) (let ((.cse4 (store (store .cse0 .cse6 v_ArrVal_305) .cse7 v_ArrVal_304))) (< (select .cse4 .cse1) (+ (select .cse4 .cse5) 1))))) (< (select .cse0 .cse8) (+ (select .cse0 .cse7) 1)) (or (and (= .cse9 .cse10) (= (+ .cse9 4) .cse11)) (= .cse10 .cse11)) (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (let ((.cse12 (store (store .cse0 .cse6 v_ArrVal_305) .cse8 v_ArrVal_304))) (< (select .cse12 .cse1) (+ (select .cse12 .cse5) 1))) (< v_ArrVal_304 .cse3))))))) is different from false [2022-11-25 17:42:04,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:42:06,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:42:08,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:42:11,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse4 (select |c_#memory_int| |c_~#array~0.base|)) (.cse5 (+ .cse8 |c_~#array~0.offset|)) (.cse9 (* |c_ULTIMATE.start_SelectionSort_~rh~0#1| 4)) (.cse10 (* |c_ULTIMATE.start_SelectionSort_~i~0#1| 4))) (let ((.cse6 (+ |c_~#array~0.offset| .cse10)) (.cse2 (+ .cse8 |c_~#array~0.offset| 4)) (.cse3 (+ .cse8 |c_~#array~0.offset| 12)) (.cse7 (+ .cse9 |c_~#array~0.offset|)) (.cse0 (select .cse4 .cse5))) (and (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (< v_ArrVal_304 .cse0) (let ((.cse1 (store (store .cse4 .cse5 v_ArrVal_305) .cse6 v_ArrVal_304))) (< (select .cse1 .cse2) (+ (select .cse1 .cse3) 1))))) (< (select .cse4 .cse7) (+ (select .cse4 .cse6) 1)) (or (and (= .cse8 .cse9) (= (+ .cse8 4) .cse10)) (= .cse9 .cse10)) (forall ((v_ArrVal_305 Int) (v_ArrVal_304 Int)) (or (let ((.cse11 (store (store .cse4 .cse5 v_ArrVal_305) .cse7 v_ArrVal_304))) (< (select .cse11 .cse2) (+ (select .cse11 .cse3) 1))) (< v_ArrVal_304 .cse0))))))) is different from false [2022-11-25 17:42:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:11,272 INFO L93 Difference]: Finished difference Result 984 states and 1342 transitions. [2022-11-25 17:42:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-25 17:42:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 60 states have internal predecessors, (145), 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 69 [2022-11-25 17:42:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:42:11,276 INFO L225 Difference]: With dead ends: 984 [2022-11-25 17:42:11,276 INFO L226 Difference]: Without dead ends: 767 [2022-11-25 17:42:11,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 7414 ImplicationChecksByTransitivity, 99.7s TimeCoverageRelationStatistics Valid=1480, Invalid=21469, Unknown=19, NotChecked=1212, Total=24180 [2022-11-25 17:42:11,286 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 456 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 70 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 38.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:42:11,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 578 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2697 Invalid, 16 Unknown, 198 Unchecked, 38.3s Time] [2022-11-25 17:42:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-11-25 17:42:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 390. [2022-11-25 17:42:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.3419023136246786) internal successors, (522), 389 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 522 transitions. [2022-11-25 17:42:11,377 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 522 transitions. Word has length 69 [2022-11-25 17:42:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:42:11,377 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 522 transitions. [2022-11-25 17:42:11,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 60 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 522 transitions. [2022-11-25 17:42:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 17:42:11,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:42:11,379 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:11,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:11,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:42:11,581 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:42:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1415361629, now seen corresponding path program 2 times [2022-11-25 17:42:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:11,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291145702] [2022-11-25 17:42:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-25 17:42:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:13,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291145702] [2022-11-25 17:42:13,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291145702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:42:13,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991340023] [2022-11-25 17:42:13,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:42:13,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:42:13,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:13,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:42:13,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:42:13,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:42:13,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:42:13,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 17:42:13,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:42:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:42:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:42:14,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:42:14,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2022-11-25 17:42:14,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:42:14,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-11-25 17:42:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-25 17:42:14,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:42:16,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_SelectionSort_~rh~0#1_58| Int)) (or (forall ((v_ArrVal_365 Int) (v_ArrVal_364 Int)) (let ((.cse1 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse0 (store (store (select |c_#memory_int| |c_~#array~0.base|) (+ .cse1 |c_~#array~0.offset|) v_ArrVal_365) (+ (* |v_ULTIMATE.start_SelectionSort_~rh~0#1_58| 4) |c_~#array~0.offset|) v_ArrVal_364))) (< (select .cse0 (+ .cse1 |c_~#array~0.offset| 12)) (select .cse0 (+ .cse1 |c_~#array~0.offset| 8)))))) (not (<= |c_ULTIMATE.start_SelectionSort_~i~0#1| |v_ULTIMATE.start_SelectionSort_~rh~0#1_58|)))) is different from false [2022-11-25 17:42:23,550 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 71 treesize of output 63 [2022-11-25 17:42:23,610 INFO L321 Elim1Store]: treesize reduction 5, result has 92.8 percent of original size [2022-11-25 17:42:23,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 131 [2022-11-25 17:42:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 122 proven. 35 refuted. 0 times theorem prover too weak. 87 trivial. 11 not checked. [2022-11-25 17:42:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991340023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:42:23,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:42:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 16] total 40 [2022-11-25 17:42:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63511174] [2022-11-25 17:42:23,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:42:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 17:42:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 17:42:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1333, Unknown=3, NotChecked=74, Total=1560 [2022-11-25 17:42:23,959 INFO L87 Difference]: Start difference. First operand 390 states and 522 transitions. Second operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:27,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:42:33,536 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:42:57,040 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:42:59,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:01,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:06,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:08,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:15,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:18,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:20,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:22,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:24,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:33,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:35,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:37,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:40,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:43:42,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:44:01,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:44:03,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:44:05,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:44:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:17,482 INFO L93 Difference]: Finished difference Result 915 states and 1228 transitions. [2022-11-25 17:44:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 17:44:17,483 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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 69 [2022-11-25 17:44:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:17,485 INFO L225 Difference]: With dead ends: 915 [2022-11-25 17:44:17,486 INFO L226 Difference]: Without dead ends: 545 [2022-11-25 17:44:17,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 81.8s TimeCoverageRelationStatistics Valid=532, Invalid=5006, Unknown=16, NotChecked=146, Total=5700 [2022-11-25 17:44:17,488 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 13 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 41.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:17,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 298 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1348 Invalid, 18 Unknown, 97 Unchecked, 41.5s Time] [2022-11-25 17:44:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-11-25 17:44:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 439. [2022-11-25 17:44:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.3538812785388128) internal successors, (593), 438 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 593 transitions. [2022-11-25 17:44:17,579 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 593 transitions. Word has length 69 [2022-11-25 17:44:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:17,579 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 593 transitions. [2022-11-25 17:44:17,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 593 transitions. [2022-11-25 17:44:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 17:44:17,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:17,582 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:17,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 17:44:17,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 17:44:17,789 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:17,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1896441887, now seen corresponding path program 3 times [2022-11-25 17:44:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:17,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785927072] [2022-11-25 17:44:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-11-25 17:44:18,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:18,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785927072] [2022-11-25 17:44:18,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785927072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:44:18,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092129833] [2022-11-25 17:44:18,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:44:18,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:44:18,851 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:44:18,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:44:19,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-25 17:44:19,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:44:19,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 17:44:19,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:44:19,254 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:44:19,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:44:19,316 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 25 [2022-11-25 17:44:19,359 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 25 [2022-11-25 17:44:19,391 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 25 [2022-11-25 17:44:19,439 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 25 [2022-11-25 17:44:19,475 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 25 [2022-11-25 17:44:19,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:19,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 36 [2022-11-25 17:44:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 78 proven. 16 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-25 17:44:20,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:44:20,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (|ULTIMATE.start_SelectionSort_~rh~0#1| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_424) |c_~#array~0.base|))) (let ((.cse0 (select .cse1 (+ |c_~#array~0.offset| (* |ULTIMATE.start_SelectionSort_~rh~0#1| 4))))) (or (< .cse0 (+ (select .cse1 (+ |c_~#array~0.offset| 12)) 1)) (< (select .cse1 (+ |c_~#array~0.offset| 8)) .cse0))))) is different from false [2022-11-25 17:44:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 161 trivial. 9 not checked. [2022-11-25 17:44:20,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092129833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:44:20,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:44:20,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-11-25 17:44:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433912342] [2022-11-25 17:44:20,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:44:20,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 17:44:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 17:44:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=660, Unknown=1, NotChecked=52, Total=812 [2022-11-25 17:44:20,694 INFO L87 Difference]: Start difference. First operand 439 states and 593 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:26,076 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 44 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:44:28,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:44:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:29,758 INFO L93 Difference]: Finished difference Result 799 states and 1088 transitions. [2022-11-25 17:44:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:44:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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 69 [2022-11-25 17:44:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:29,761 INFO L225 Difference]: With dead ends: 799 [2022-11-25 17:44:29,762 INFO L226 Difference]: Without dead ends: 385 [2022-11-25 17:44:29,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=340, Invalid=1385, Unknown=1, NotChecked=80, Total=1806 [2022-11-25 17:44:29,764 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 115 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:29,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 220 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 1 Unknown, 23 Unchecked, 2.5s Time] [2022-11-25 17:44:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-11-25 17:44:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 378. [2022-11-25 17:44:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.363395225464191) internal successors, (514), 377 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-11-25 17:44:29,885 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 69 [2022-11-25 17:44:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:29,886 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-11-25 17:44:29,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-11-25 17:44:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 17:44:29,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:29,891 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:29,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 17:44:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:30,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash -882650715, now seen corresponding path program 4 times [2022-11-25 17:44:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:30,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277864498] [2022-11-25 17:44:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 94 proven. 24 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-25 17:44:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:31,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277864498] [2022-11-25 17:44:31,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277864498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:44:31,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096900380] [2022-11-25 17:44:31,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:44:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:44:31,147 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:44:31,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:44:31,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:44:31,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:44:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 17:44:31,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:44:31,408 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:44:31,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:44:31,513 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 15 treesize of output 11 [2022-11-25 17:44:32,015 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 18 treesize of output 20 [2022-11-25 17:44:32,284 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 18 treesize of output 20 [2022-11-25 17:44:32,478 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 18 treesize of output 20 [2022-11-25 17:44:32,622 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 18 treesize of output 20 [2022-11-25 17:44:32,704 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 18 treesize of output 20 [2022-11-25 17:44:32,917 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 17:44:32,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 17:44:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-25 17:44:32,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:44:33,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:33,593 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 22 treesize of output 23 [2022-11-25 17:44:33,605 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:44:33,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 17:44:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-25 17:44:33,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096900380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:44:33,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:44:33,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2022-11-25 17:44:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144196960] [2022-11-25 17:44:33,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:44:33,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 17:44:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 17:44:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=712, Unknown=9, NotChecked=0, Total=812 [2022-11-25 17:44:33,726 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:35,721 INFO L93 Difference]: Finished difference Result 738 states and 1011 transitions. [2022-11-25 17:44:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:44:35,722 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-25 17:44:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:35,724 INFO L225 Difference]: With dead ends: 738 [2022-11-25 17:44:35,724 INFO L226 Difference]: Without dead ends: 385 [2022-11-25 17:44:35,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=420, Invalid=1641, Unknown=9, NotChecked=0, Total=2070 [2022-11-25 17:44:35,725 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 282 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:35,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 110 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:44:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-11-25 17:44:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 381. [2022-11-25 17:44:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.3605263157894736) internal successors, (517), 380 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 517 transitions. [2022-11-25 17:44:35,844 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 517 transitions. Word has length 69 [2022-11-25 17:44:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:35,845 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 517 transitions. [2022-11-25 17:44:35,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 517 transitions. [2022-11-25 17:44:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 17:44:35,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:35,847 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:35,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:44:36,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:44:36,054 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1757098617, now seen corresponding path program 1 times [2022-11-25 17:44:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:36,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216052167] [2022-11-25 17:44:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 117 proven. 73 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-25 17:44:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:37,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216052167] [2022-11-25 17:44:37,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216052167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:44:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460499037] [2022-11-25 17:44:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:44:37,739 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:44:37,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:44:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:37,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 17:44:37,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:44:37,940 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:44:37,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:44:38,007 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 23 [2022-11-25 17:44:38,092 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 23 [2022-11-25 17:44:38,208 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 23 [2022-11-25 17:44:38,248 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 23 [2022-11-25 17:44:38,286 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 23 [2022-11-25 17:44:39,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:39,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:44:39,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:39,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:39,211 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-11-25 17:44:39,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:39,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:40,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:40,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:44:40,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 18 [2022-11-25 17:44:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 117 proven. 86 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-25 17:44:40,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:44:42,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_544) |c_~#array~0.base|))) (let ((.cse0 (select .cse2 (+ |c_~#array~0.offset| 12))) (.cse1 (select .cse2 (+ 16 |c_~#array~0.offset|)))) (or (< .cse0 (+ .cse1 1)) (< (select .cse2 (+ |c_~#array~0.offset| 8)) (+ .cse0 1)) (< .cse1 (select .cse2 |c_~#array~0.offset|)))))) is different from false [2022-11-25 17:44:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 127 proven. 55 refuted. 0 times theorem prover too weak. 66 trivial. 9 not checked. [2022-11-25 17:44:42,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460499037] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:44:42,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:44:42,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 58 [2022-11-25 17:44:42,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330092491] [2022-11-25 17:44:42,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:44:42,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-25 17:44:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:42,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-25 17:44:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2968, Unknown=1, NotChecked=112, Total=3422 [2022-11-25 17:44:42,627 INFO L87 Difference]: Start difference. First operand 381 states and 517 transitions. Second operand has 59 states, 59 states have (on average 2.016949152542373) internal successors, (119), 58 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:52,692 INFO L93 Difference]: Finished difference Result 913 states and 1255 transitions. [2022-11-25 17:44:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 17:44:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.016949152542373) internal successors, (119), 58 states have internal predecessors, (119), 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 73 [2022-11-25 17:44:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:52,695 INFO L225 Difference]: With dead ends: 913 [2022-11-25 17:44:52,695 INFO L226 Difference]: Without dead ends: 583 [2022-11-25 17:44:52,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1547, Invalid=8556, Unknown=1, NotChecked=198, Total=10302 [2022-11-25 17:44:52,698 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 622 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:52,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 260 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 997 Invalid, 0 Unknown, 51 Unchecked, 2.0s Time] [2022-11-25 17:44:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-11-25 17:44:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 427. [2022-11-25 17:44:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.3474178403755868) internal successors, (574), 426 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2022-11-25 17:44:52,834 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 73 [2022-11-25 17:44:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:52,834 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2022-11-25 17:44:52,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.016949152542373) internal successors, (119), 58 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2022-11-25 17:44:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 17:44:52,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:52,836 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:52,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:44:53,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 17:44:53,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1737329913, now seen corresponding path program 2 times [2022-11-25 17:44:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:53,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893078737] [2022-11-25 17:44:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:53,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 119 proven. 29 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-25 17:44:54,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:54,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893078737] [2022-11-25 17:44:54,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893078737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:44:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271567272] [2022-11-25 17:44:54,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:44:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:44:54,318 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:44:54,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:44:54,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:44:54,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:44:54,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 17:44:54,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:44:54,746 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 23 treesize of output 24 [2022-11-25 17:44:55,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:55,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 44 [2022-11-25 17:44:55,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:55,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-11-25 17:44:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 55 proven. 142 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 17:44:55,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:45:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 8 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 17:45:00,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271567272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:45:00,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:45:00,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 11] total 36 [2022-11-25 17:45:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241490080] [2022-11-25 17:45:00,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:45:00,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 17:45:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:45:00,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 17:45:00,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1119, Unknown=1, NotChecked=0, Total=1260 [2022-11-25 17:45:00,084 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:45:15,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:17,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:19,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:20,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:22,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:24,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:27,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:45:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:45:33,353 INFO L93 Difference]: Finished difference Result 1078 states and 1481 transitions. [2022-11-25 17:45:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-25 17:45:33,354 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 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 73 [2022-11-25 17:45:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:45:33,357 INFO L225 Difference]: With dead ends: 1078 [2022-11-25 17:45:33,357 INFO L226 Difference]: Without dead ends: 728 [2022-11-25 17:45:33,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=966, Invalid=7585, Unknown=5, NotChecked=0, Total=8556 [2022-11-25 17:45:33,359 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 366 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 25 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:45:33,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 274 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 864 Invalid, 6 Unknown, 0 Unchecked, 14.9s Time] [2022-11-25 17:45:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-25 17:45:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 403. [2022-11-25 17:45:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.3507462686567164) internal successors, (543), 402 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:45:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 543 transitions. [2022-11-25 17:45:33,461 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 543 transitions. Word has length 73 [2022-11-25 17:45:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:45:33,461 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 543 transitions. [2022-11-25 17:45:33,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:45:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 543 transitions. [2022-11-25 17:45:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 17:45:33,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:45:33,463 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:45:33,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:45:33,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:45:33,663 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:45:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:45:33,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1614104453, now seen corresponding path program 3 times [2022-11-25 17:45:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:45:33,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859259447] [2022-11-25 17:45:33,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:45:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-11-25 17:45:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:45:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859259447] [2022-11-25 17:45:34,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859259447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:45:34,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214832454] [2022-11-25 17:45:34,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:45:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:45:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:45:34,637 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:45:34,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:45:34,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-11-25 17:45:34,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:45:34,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:45:34,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:45:34,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:45:34,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:45:35,131 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 15 treesize of output 11 [2022-11-25 17:45:35,239 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 17:45:35,239 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:45:35,482 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 16 treesize of output 18 [2022-11-25 17:45:35,596 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 16 treesize of output 18 [2022-11-25 17:45:35,688 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 16 treesize of output 18 [2022-11-25 17:45:35,758 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 16 treesize of output 18 [2022-11-25 17:45:35,795 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 16 treesize of output 18 [2022-11-25 17:45:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-11-25 17:45:36,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:45:36,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:45:36,798 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 2 case distinctions, treesize of input 32 treesize of output 38 [2022-11-25 17:45:36,812 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:45:36,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 17:45:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-11-25 17:45:37,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214832454] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:45:37,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:45:37,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 38 [2022-11-25 17:45:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516144870] [2022-11-25 17:45:37,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:45:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 17:45:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:45:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 17:45:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1199, Unknown=4, NotChecked=0, Total=1482 [2022-11-25 17:45:37,159 INFO L87 Difference]: Start difference. First operand 403 states and 543 transitions. Second operand has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:45:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:45:39,637 INFO L93 Difference]: Finished difference Result 820 states and 1100 transitions. [2022-11-25 17:45:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 17:45:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 38 states have internal predecessors, (95), 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 73 [2022-11-25 17:45:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:45:39,641 INFO L225 Difference]: With dead ends: 820 [2022-11-25 17:45:39,641 INFO L226 Difference]: Without dead ends: 818 [2022-11-25 17:45:39,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=962, Invalid=3590, Unknown=4, NotChecked=0, Total=4556 [2022-11-25 17:45:39,643 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 408 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:45:39,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 297 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:45:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-11-25 17:45:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 407. [2022-11-25 17:45:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.3472906403940887) internal successors, (547), 406 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:45:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 547 transitions. [2022-11-25 17:45:39,790 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 547 transitions. Word has length 73 [2022-11-25 17:45:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:45:39,791 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 547 transitions. [2022-11-25 17:45:39,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:45:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 547 transitions. [2022-11-25 17:45:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 17:45:39,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:45:39,793 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:45:39,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:45:39,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:45:39,999 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:45:40,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:45:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -613320047, now seen corresponding path program 4 times [2022-11-25 17:45:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:45:40,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375320886] [2022-11-25 17:45:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:45:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 17:45:41,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:45:41,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375320886] [2022-11-25 17:45:41,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375320886] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:45:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584767204] [2022-11-25 17:45:41,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:45:41,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:45:41,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:45:41,896 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:45:41,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:45:42,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:45:42,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:45:42,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 17:45:42,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:45:42,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:45:42,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 42 [2022-11-25 17:45:42,906 INFO L321 Elim1Store]: treesize reduction 122, result has 9.6 percent of original size [2022-11-25 17:45:42,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 42 [2022-11-25 17:45:43,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:45:43,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-11-25 17:45:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 55 proven. 168 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-25 17:45:43,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:45:50,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 Int) (v_ArrVal_726 Int)) (let ((.cse3 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|)) (.cse1 (+ .cse3 |c_~#array~0.offset|))) (or (< (select .cse0 .cse1) v_ArrVal_726) (let ((.cse2 (store (store .cse0 .cse1 v_ArrVal_727) (+ |c_~#array~0.offset| 4 (* |c_ULTIMATE.start_SelectionSort_~i~0#1| 4)) v_ArrVal_726))) (< (select .cse2 (+ .cse3 |c_~#array~0.offset| 8)) (+ (select .cse2 (+ .cse3 |c_~#array~0.offset| 4)) 1))))))) is different from false [2022-11-25 17:45:50,901 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 84 treesize of output 74 [2022-11-25 17:45:50,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:45:50,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 174 [2022-11-25 17:45:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 147 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 4 not checked. [2022-11-25 17:45:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584767204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:45:51,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:45:51,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 16] total 52 [2022-11-25 17:45:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490008427] [2022-11-25 17:45:51,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:45:51,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 17:45:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:45:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 17:45:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2388, Unknown=3, NotChecked=98, Total=2652 [2022-11-25 17:45:51,385 INFO L87 Difference]: Start difference. First operand 407 states and 547 transitions. Second operand has 52 states, 52 states have (on average 2.8653846153846154) internal successors, (149), 52 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:36,980 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 72 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:46:55,539 WARN L233 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 93 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:47:07,099 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 90 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:47:14,022 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 72 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:47:21,684 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 69 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:47:23,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:47:25,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:47:33,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:47:35,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:47:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:40,076 INFO L93 Difference]: Finished difference Result 1051 states and 1434 transitions. [2022-11-25 17:47:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-25 17:47:40,077 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8653846153846154) internal successors, (149), 52 states have internal predecessors, (149), 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 77 [2022-11-25 17:47:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:40,079 INFO L225 Difference]: With dead ends: 1051 [2022-11-25 17:47:40,080 INFO L226 Difference]: Without dead ends: 855 [2022-11-25 17:47:40,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6724 ImplicationChecksByTransitivity, 105.5s TimeCoverageRelationStatistics Valid=1675, Invalid=18908, Unknown=13, NotChecked=284, Total=20880 [2022-11-25 17:47:40,083 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 503 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:40,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 801 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2227 Invalid, 4 Unknown, 101 Unchecked, 11.6s Time] [2022-11-25 17:47:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-25 17:47:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 501. [2022-11-25 17:47:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.332) internal successors, (666), 500 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:47:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 666 transitions. [2022-11-25 17:47:40,318 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 666 transitions. Word has length 77 [2022-11-25 17:47:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:40,318 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 666 transitions. [2022-11-25 17:47:40,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.8653846153846154) internal successors, (149), 52 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:47:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 666 transitions. [2022-11-25 17:47:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 17:47:40,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:40,320 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:40,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:47:40,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:47:40,521 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2033195035, now seen corresponding path program 5 times [2022-11-25 17:47:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:40,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001398908] [2022-11-25 17:47:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 90 proven. 122 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 17:47:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001398908] [2022-11-25 17:47:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001398908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:47:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137608661] [2022-11-25 17:47:42,802 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:47:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:42,804 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:47:42,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:47:43,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-25 17:47:43,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:47:43,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-25 17:47:43,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:47:43,180 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:47:43,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:47:43,307 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 15 treesize of output 11 [2022-11-25 17:47:43,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:47:43,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-25 17:47:43,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:47:43,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-25 17:47:43,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:47:43,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-25 17:47:43,919 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 16 treesize of output 18 [2022-11-25 17:47:44,057 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 16 treesize of output 18 [2022-11-25 17:47:44,166 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 16 treesize of output 18 [2022-11-25 17:47:44,260 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 16 treesize of output 18 [2022-11-25 17:47:44,317 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 16 treesize of output 18 [2022-11-25 17:47:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-11-25 17:47:44,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:47:45,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_797) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) is different from false [2022-11-25 17:47:47,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 Int) (v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~i~1#1_98| Int) (v_ArrVal_797 (Array Int Int))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_98| 1) |c_ULTIMATE.start_main_~i~1#1|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_790) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_792)) |c_~#array~0.base| v_ArrVal_797) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3))) is different from false [2022-11-25 17:47:49,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_99| Int)) (or (forall ((v_ArrVal_792 Int) (v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~i~1#1_98| Int) (v_ArrVal_797 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_99| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_790) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_792)) |c_~#array~0.base| v_ArrVal_797) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_98| 1) |v_ULTIMATE.start_main_~i~1#1_99|)))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_99| 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2022-11-25 17:47:51,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 Int) (v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~i~1#1_99| Int) (|v_ULTIMATE.start_main_~i~1#1_98| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_787 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_787) (+ (* |v_ULTIMATE.start_main_~i~1#1_99| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_790) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_792)) |c_~#array~0.base| v_ArrVal_797) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_99| 1) |c_ULTIMATE.start_main_~i~1#1|)) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_98| 1) |v_ULTIMATE.start_main_~i~1#1_99|)))) is different from false [2022-11-25 17:47:53,932 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_100| Int)) (or (forall ((v_ArrVal_792 Int) (v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~i~1#1_99| Int) (|v_ULTIMATE.start_main_~i~1#1_98| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_787 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* 4 |v_ULTIMATE.start_main_~i~1#1_100|) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_787) (+ (* |v_ULTIMATE.start_main_~i~1#1_99| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_790) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_792)) |c_~#array~0.base| v_ArrVal_797) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_99| 1) |v_ULTIMATE.start_main_~i~1#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~1#1_98| 1) |v_ULTIMATE.start_main_~i~1#1_99|)))) (not (<= (+ 1 |v_ULTIMATE.start_main_~i~1#1_100|) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2022-11-25 17:47:54,012 INFO L321 Elim1Store]: treesize reduction 203, result has 19.4 percent of original size [2022-11-25 17:47:54,012 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 4 case distinctions, treesize of input 45 treesize of output 61 [2022-11-25 17:47:54,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:47:54,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 17:47:54,038 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 7 treesize of output 3 [2022-11-25 17:47:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 221 trivial. 30 not checked. [2022-11-25 17:47:54,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137608661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:47:54,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:47:54,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 52 [2022-11-25 17:47:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363016287] [2022-11-25 17:47:54,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:47:54,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-25 17:47:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-25 17:47:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2074, Unknown=10, NotChecked=480, Total=2756 [2022-11-25 17:47:54,211 INFO L87 Difference]: Start difference. First operand 501 states and 666 transitions. Second operand has 53 states, 53 states have (on average 2.547169811320755) internal successors, (135), 52 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:48:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:06,452 INFO L93 Difference]: Finished difference Result 1276 states and 1765 transitions. [2022-11-25 17:48:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-25 17:48:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.547169811320755) internal successors, (135), 52 states have internal predecessors, (135), 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 81 [2022-11-25 17:48:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:06,457 INFO L225 Difference]: With dead ends: 1276 [2022-11-25 17:48:06,457 INFO L226 Difference]: Without dead ends: 1023 [2022-11-25 17:48:06,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1302, Invalid=8405, Unknown=15, NotChecked=990, Total=10712 [2022-11-25 17:48:06,460 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 567 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 110 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:06,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 519 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1163 Invalid, 11 Unknown, 373 Unchecked, 1.6s Time] [2022-11-25 17:48:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-11-25 17:48:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 505. [2022-11-25 17:48:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.3293650793650793) internal successors, (670), 504 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:48:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 670 transitions. [2022-11-25 17:48:06,709 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 670 transitions. Word has length 81 [2022-11-25 17:48:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:06,709 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 670 transitions. [2022-11-25 17:48:06,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.547169811320755) internal successors, (135), 52 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:48:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 670 transitions. [2022-11-25 17:48:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 17:48:06,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:06,712 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:06,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-25 17:48:06,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 17:48:06,919 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:06,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2048079039, now seen corresponding path program 6 times [2022-11-25 17:48:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:06,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200510234] [2022-11-25 17:48:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-11-25 17:48:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200510234] [2022-11-25 17:48:08,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200510234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:48:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055883006] [2022-11-25 17:48:08,485 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:48:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:48:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:48:08,486 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:48:08,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491ba1e3-133a-4002-ba5e-644f1cd0e246/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:48:08,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-11-25 17:48:08,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:48:08,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 17:48:08,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:48:09,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:48:09,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-11-25 17:48:10,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:48:10,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:48:10,236 INFO L321 Elim1Store]: treesize reduction 52, result has 61.2 percent of original size [2022-11-25 17:48:10,236 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 9 case distinctions, treesize of input 50 treesize of output 99 [2022-11-25 17:48:10,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:48:10,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 136 [2022-11-25 17:48:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 4 proven. 201 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-25 17:48:13,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:48:25,665 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 139 treesize of output 125 [2022-11-25 17:48:25,975 INFO L321 Elim1Store]: treesize reduction 96, result has 61.8 percent of original size [2022-11-25 17:48:25,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 13893 treesize of output 12665