./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:42:06,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:42:06,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:42:06,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:42:06,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:42:06,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:42:06,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:42:06,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:42:06,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:42:06,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:42:06,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:42:06,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:42:06,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:42:06,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:42:06,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:42:06,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:42:06,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:42:06,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:42:06,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:42:06,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:42:06,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:42:06,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:42:06,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:42:06,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:42:06,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:42:06,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:42:06,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:42:06,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:42:06,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:42:06,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:42:06,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:42:06,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:42:06,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:42:06,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:42:06,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:42:06,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:42:06,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:42:06,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:42:06,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:42:06,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:42:06,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:42:06,462 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:42:06,514 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:42:06,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:42:06,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:42:06,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:42:06,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:42:06,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:42:06,527 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:42:06,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:42:06,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:42:06,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:42:06,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:42:06,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:42:06,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:42:06,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:42:06,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:42:06,530 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:42:06,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:42:06,530 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:42:06,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:42:06,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:42:06,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:42:06,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:42:06,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:42:06,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:42:06,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:42:06,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:42:06,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:42:06,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:42:06,533 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:42:06,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:42:06,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:42:06,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:42:06,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/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_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2021-10-21 19:42:06,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:42:06,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:42:06,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:42:06,847 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:42:06,848 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:42:06,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/loop-invgen/heapsort.i [2021-10-21 19:42:06,932 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/data/436d24ee4/86c89fbdb2ce4b9e86fa84bea4aec9aa/FLAG64c1a7241 [2021-10-21 19:42:07,411 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:42:07,412 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/sv-benchmarks/c/loop-invgen/heapsort.i [2021-10-21 19:42:07,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/data/436d24ee4/86c89fbdb2ce4b9e86fa84bea4aec9aa/FLAG64c1a7241 [2021-10-21 19:42:07,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/data/436d24ee4/86c89fbdb2ce4b9e86fa84bea4aec9aa [2021-10-21 19:42:07,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:42:07,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:42:07,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:42:07,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:42:07,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:42:07,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:42:07" (1/1) ... [2021-10-21 19:42:07,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1bee1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:07, skipping insertion in model container [2021-10-21 19:42:07,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:42:07" (1/1) ... [2021-10-21 19:42:07,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:42:07,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:42:07,985 WARN L228 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_b94e42bf-f622-4ff1-ac81-38d8bd195c80/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-10-21 19:42:08,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:42:08,039 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:42:08,053 WARN L228 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_b94e42bf-f622-4ff1-ac81-38d8bd195c80/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-10-21 19:42:08,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:42:08,117 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:42:08,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08 WrapperNode [2021-10-21 19:42:08,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:42:08,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:42:08,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:42:08,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:42:08,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:42:08,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:42:08,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:42:08,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:42:08,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:42:08,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:42:08,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:42:08,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:42:08,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (1/1) ... [2021-10-21 19:42:08,209 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:42:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:08,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:08,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:42:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:42:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:42:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:42:08,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:42:08,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:42:08,604 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-10-21 19:42:08,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:08 BoogieIcfgContainer [2021-10-21 19:42:08,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:42:08,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:42:08,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:42:08,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:42:08,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:42:07" (1/3) ... [2021-10-21 19:42:08,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4427130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:42:08, skipping insertion in model container [2021-10-21 19:42:08,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:08" (2/3) ... [2021-10-21 19:42:08,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4427130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:42:08, skipping insertion in model container [2021-10-21 19:42:08,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:08" (3/3) ... [2021-10-21 19:42:08,621 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2021-10-21 19:42:08,641 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:42:08,642 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-10-21 19:42:08,693 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:42:08,716 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:42:08,717 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-10-21 19:42:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 70 states have internal predecessors, (94), 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) [2021-10-21 19:42:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:42:08,769 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:08,770 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:08,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1222313301, now seen corresponding path program 1 times [2021-10-21 19:42:08,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:08,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940731602] [2021-10-21 19:42:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:08,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:08,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:08,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940731602] [2021-10-21 19:42:08,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940731602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:08,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:08,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:42:08,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481566461] [2021-10-21 19:42:08,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-21 19:42:08,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-21 19:42:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 19:42:08,967 INFO L87 Difference]: Start difference. First operand has 71 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 70 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2021-10-21 19:42:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:08,990 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2021-10-21 19:42:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-21 19:42:08,991 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2021-10-21 19:42:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:09,001 INFO L225 Difference]: With dead ends: 138 [2021-10-21 19:42:09,001 INFO L226 Difference]: Without dead ends: 67 [2021-10-21 19:42:09,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 19:42:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-21 19:42:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-10-21 19:42:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 66 states have internal predecessors, (73), 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) [2021-10-21 19:42:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2021-10-21 19:42:09,043 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 9 [2021-10-21 19:42:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:09,045 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2021-10-21 19:42:09,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2021-10-21 19:42:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2021-10-21 19:42:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:42:09,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:09,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:09,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:42:09,047 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1218380889, now seen corresponding path program 1 times [2021-10-21 19:42:09,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:09,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108639445] [2021-10-21 19:42:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:09,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:09,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:09,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108639445] [2021-10-21 19:42:09,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108639445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:09,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:09,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:42:09,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119959703] [2021-10-21 19:42:09,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:42:09,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:09,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:42:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:42:09,163 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:09,293 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-10-21 19:42:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:42:09,293 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 [2021-10-21 19:42:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:09,295 INFO L225 Difference]: With dead ends: 72 [2021-10-21 19:42:09,295 INFO L226 Difference]: Without dead ends: 70 [2021-10-21 19:42:09,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:42:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-21 19:42:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-10-21 19:42:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 64 states have internal predecessors, (71), 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) [2021-10-21 19:42:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-10-21 19:42:09,304 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 9 [2021-10-21 19:42:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:09,305 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-10-21 19:42:09,305 INFO L471 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) [2021-10-21 19:42:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-10-21 19:42:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:42:09,306 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:09,306 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:09,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:42:09,307 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1218404721, now seen corresponding path program 1 times [2021-10-21 19:42:09,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:09,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222526531] [2021-10-21 19:42:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:09,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:09,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:09,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222526531] [2021-10-21 19:42:09,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222526531] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:09,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:09,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:42:09,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90410179] [2021-10-21 19:42:09,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:42:09,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:42:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:42:09,371 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2021-10-21 19:42:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:09,468 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-10-21 19:42:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:42:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 [2021-10-21 19:42:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:09,470 INFO L225 Difference]: With dead ends: 72 [2021-10-21 19:42:09,470 INFO L226 Difference]: Without dead ends: 70 [2021-10-21 19:42:09,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-21 19:42:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2021-10-21 19:42:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-10-21 19:42:09,481 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2021-10-21 19:42:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:09,481 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-10-21 19:42:09,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2021-10-21 19:42:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-10-21 19:42:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:42:09,483 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:09,483 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:09,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:42:09,484 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1218310388, now seen corresponding path program 1 times [2021-10-21 19:42:09,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:09,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407028743] [2021-10-21 19:42:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:09,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:09,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:09,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407028743] [2021-10-21 19:42:09,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407028743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:09,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:09,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:42:09,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211290311] [2021-10-21 19:42:09,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:42:09,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:42:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:09,606 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:09,847 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2021-10-21 19:42:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:42:09,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-21 19:42:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:09,853 INFO L225 Difference]: With dead ends: 128 [2021-10-21 19:42:09,853 INFO L226 Difference]: Without dead ends: 120 [2021-10-21 19:42:09,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:42:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-10-21 19:42:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2021-10-21 19:42:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 93 states have internal predecessors, (112), 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) [2021-10-21 19:42:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2021-10-21 19:42:09,876 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 9 [2021-10-21 19:42:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:09,877 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2021-10-21 19:42:09,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2021-10-21 19:42:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:42:09,878 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:09,878 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:09,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:42:09,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1661877060, now seen corresponding path program 1 times [2021-10-21 19:42:09,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:09,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730083442] [2021-10-21 19:42:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:09,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:09,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:09,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730083442] [2021-10-21 19:42:09,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730083442] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:09,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:09,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:09,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674822237] [2021-10-21 19:42:09,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:09,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:09,993 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) [2021-10-21 19:42:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:10,245 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2021-10-21 19:42:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:42:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 11 [2021-10-21 19:42:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:10,247 INFO L225 Difference]: With dead ends: 156 [2021-10-21 19:42:10,248 INFO L226 Difference]: Without dead ends: 154 [2021-10-21 19:42:10,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-10-21 19:42:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2021-10-21 19:42:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 127 states have internal predecessors, (158), 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) [2021-10-21 19:42:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-10-21 19:42:10,291 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 11 [2021-10-21 19:42:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:10,293 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-10-21 19:42:10,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) [2021-10-21 19:42:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-10-21 19:42:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:42:10,295 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:10,295 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:10,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:42:10,296 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1638973740, now seen corresponding path program 1 times [2021-10-21 19:42:10,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:10,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054405884] [2021-10-21 19:42:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:10,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:10,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:10,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054405884] [2021-10-21 19:42:10,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054405884] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:10,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:10,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:42:10,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757450111] [2021-10-21 19:42:10,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:42:10,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:42:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:42:10,382 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-10-21 19:42:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:10,479 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2021-10-21 19:42:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:42:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 11 [2021-10-21 19:42:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:10,496 INFO L225 Difference]: With dead ends: 138 [2021-10-21 19:42:10,496 INFO L226 Difference]: Without dead ends: 136 [2021-10-21 19:42:10,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-10-21 19:42:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2021-10-21 19:42:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 125 states have internal predecessors, (154), 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) [2021-10-21 19:42:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-10-21 19:42:10,532 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 11 [2021-10-21 19:42:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:10,532 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-10-21 19:42:10,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-10-21 19:42:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-10-21 19:42:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:42:10,533 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:10,533 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:10,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:42:10,534 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1729632713, now seen corresponding path program 1 times [2021-10-21 19:42:10,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:10,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322409473] [2021-10-21 19:42:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:10,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:10,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:10,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322409473] [2021-10-21 19:42:10,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322409473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:10,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:10,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:10,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482442075] [2021-10-21 19:42:10,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:10,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:10,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:10,647 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) [2021-10-21 19:42:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:10,886 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2021-10-21 19:42:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:42:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 11 [2021-10-21 19:42:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:10,888 INFO L225 Difference]: With dead ends: 235 [2021-10-21 19:42:10,889 INFO L226 Difference]: Without dead ends: 229 [2021-10-21 19:42:10,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 38.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-10-21 19:42:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174. [2021-10-21 19:42:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 173 states have internal predecessors, (220), 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) [2021-10-21 19:42:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2021-10-21 19:42:10,907 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 11 [2021-10-21 19:42:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:10,908 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2021-10-21 19:42:10,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) [2021-10-21 19:42:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2021-10-21 19:42:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:42:10,909 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:10,909 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:10,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:42:10,909 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1823743610, now seen corresponding path program 1 times [2021-10-21 19:42:10,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:10,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941858752] [2021-10-21 19:42:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:10,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:10,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:10,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941858752] [2021-10-21 19:42:10,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941858752] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:10,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:10,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:42:10,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606315806] [2021-10-21 19:42:10,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:42:10,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:42:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:42:10,936 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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) [2021-10-21 19:42:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:10,968 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2021-10-21 19:42:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:42:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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 11 [2021-10-21 19:42:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:10,971 INFO L225 Difference]: With dead ends: 375 [2021-10-21 19:42:10,971 INFO L226 Difference]: Without dead ends: 291 [2021-10-21 19:42:10,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:42:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-10-21 19:42:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2021-10-21 19:42:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 261 states have (on average 1.371647509578544) internal successors, (358), 270 states have internal predecessors, (358), 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) [2021-10-21 19:42:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2021-10-21 19:42:10,998 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 11 [2021-10-21 19:42:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:10,999 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2021-10-21 19:42:10,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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) [2021-10-21 19:42:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2021-10-21 19:42:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:42:11,000 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:11,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:11,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:42:11,001 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:11,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1755987957, now seen corresponding path program 1 times [2021-10-21 19:42:11,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773588051] [2021-10-21 19:42:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:11,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:11,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773588051] [2021-10-21 19:42:11,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773588051] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:11,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:11,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:42:11,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212634651] [2021-10-21 19:42:11,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:42:11,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:42:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:42:11,035 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-10-21 19:42:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:11,079 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2021-10-21 19:42:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:42:11,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 11 [2021-10-21 19:42:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:11,081 INFO L225 Difference]: With dead ends: 284 [2021-10-21 19:42:11,081 INFO L226 Difference]: Without dead ends: 240 [2021-10-21 19:42:11,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-21 19:42:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-10-21 19:42:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 230 states have (on average 1.373913043478261) internal successors, (316), 239 states have internal predecessors, (316), 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) [2021-10-21 19:42:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2021-10-21 19:42:11,115 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 11 [2021-10-21 19:42:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:11,116 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2021-10-21 19:42:11,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-10-21 19:42:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2021-10-21 19:42:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:42:11,118 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:11,118 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:11,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:42:11,119 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2105123171, now seen corresponding path program 1 times [2021-10-21 19:42:11,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270932403] [2021-10-21 19:42:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:11,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:11,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270932403] [2021-10-21 19:42:11,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270932403] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:11,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:11,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:42:11,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657293859] [2021-10-21 19:42:11,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:42:11,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:11,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:42:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:11,218 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2021-10-21 19:42:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:11,373 INFO L93 Difference]: Finished difference Result 380 states and 493 transitions. [2021-10-21 19:42:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:42:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2021-10-21 19:42:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:11,377 INFO L225 Difference]: With dead ends: 380 [2021-10-21 19:42:11,377 INFO L226 Difference]: Without dead ends: 372 [2021-10-21 19:42:11,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:42:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-21 19:42:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 200. [2021-10-21 19:42:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.34375) internal successors, (258), 199 states have internal predecessors, (258), 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) [2021-10-21 19:42:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2021-10-21 19:42:11,407 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 15 [2021-10-21 19:42:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:11,408 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2021-10-21 19:42:11,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2021-10-21 19:42:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2021-10-21 19:42:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:42:11,411 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:11,411 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:11,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:42:11,412 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,412 INFO L82 PathProgramCache]: Analyzing trace with hash 639895389, now seen corresponding path program 1 times [2021-10-21 19:42:11,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998302655] [2021-10-21 19:42:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:11,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:11,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998302655] [2021-10-21 19:42:11,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998302655] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:11,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:11,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:42:11,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977009796] [2021-10-21 19:42:11,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:42:11,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:42:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:11,504 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2021-10-21 19:42:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:11,628 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2021-10-21 19:42:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:42:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2021-10-21 19:42:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:11,631 INFO L225 Difference]: With dead ends: 302 [2021-10-21 19:42:11,631 INFO L226 Difference]: Without dead ends: 300 [2021-10-21 19:42:11,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:42:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-21 19:42:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2021-10-21 19:42:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 245 states have internal predecessors, (312), 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) [2021-10-21 19:42:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 312 transitions. [2021-10-21 19:42:11,655 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 312 transitions. Word has length 15 [2021-10-21 19:42:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:11,655 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 312 transitions. [2021-10-21 19:42:11,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2021-10-21 19:42:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 312 transitions. [2021-10-21 19:42:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:42:11,656 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:11,656 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:11,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:42:11,657 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1672864291, now seen corresponding path program 1 times [2021-10-21 19:42:11,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282465039] [2021-10-21 19:42:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:11,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:11,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282465039] [2021-10-21 19:42:11,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282465039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:11,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:11,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:42:11,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239840514] [2021-10-21 19:42:11,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:42:11,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:42:11,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:11,728 INFO L87 Difference]: Start difference. First operand 246 states and 312 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:11,886 INFO L93 Difference]: Finished difference Result 734 states and 889 transitions. [2021-10-21 19:42:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:42:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-21 19:42:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:11,890 INFO L225 Difference]: With dead ends: 734 [2021-10-21 19:42:11,890 INFO L226 Difference]: Without dead ends: 556 [2021-10-21 19:42:11,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:42:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-10-21 19:42:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 246. [2021-10-21 19:42:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.3025210084033614) internal successors, (310), 245 states have internal predecessors, (310), 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) [2021-10-21 19:42:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2021-10-21 19:42:11,926 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 16 [2021-10-21 19:42:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:11,927 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2021-10-21 19:42:11,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2021-10-21 19:42:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 19:42:11,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:11,928 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:11,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:42:11,929 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,929 INFO L82 PathProgramCache]: Analyzing trace with hash 759304320, now seen corresponding path program 1 times [2021-10-21 19:42:11,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073332036] [2021-10-21 19:42:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:11,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:11,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073332036] [2021-10-21 19:42:11,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073332036] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:11,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:11,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:11,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238363949] [2021-10-21 19:42:11,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:11,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:11,997 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:12,163 INFO L93 Difference]: Finished difference Result 380 states and 474 transitions. [2021-10-21 19:42:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:42:12,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-21 19:42:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:12,166 INFO L225 Difference]: With dead ends: 380 [2021-10-21 19:42:12,166 INFO L226 Difference]: Without dead ends: 378 [2021-10-21 19:42:12,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-21 19:42:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 308. [2021-10-21 19:42:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 300 states have (on average 1.3066666666666666) internal successors, (392), 307 states have internal predecessors, (392), 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) [2021-10-21 19:42:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 392 transitions. [2021-10-21 19:42:12,202 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 392 transitions. Word has length 17 [2021-10-21 19:42:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:12,202 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 392 transitions. [2021-10-21 19:42:12,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 392 transitions. [2021-10-21 19:42:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 19:42:12,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:12,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:12,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:42:12,204 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash -750791926, now seen corresponding path program 1 times [2021-10-21 19:42:12,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:12,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390026128] [2021-10-21 19:42:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:12,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:12,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:12,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390026128] [2021-10-21 19:42:12,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390026128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:12,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:12,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:12,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752994072] [2021-10-21 19:42:12,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:12,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:12,249 INFO L87 Difference]: Start difference. First operand 308 states and 392 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:12,447 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2021-10-21 19:42:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:42:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-21 19:42:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:12,450 INFO L225 Difference]: With dead ends: 410 [2021-10-21 19:42:12,450 INFO L226 Difference]: Without dead ends: 406 [2021-10-21 19:42:12,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-10-21 19:42:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 216. [2021-10-21 19:42:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 215 states have internal predecessors, (266), 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) [2021-10-21 19:42:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2021-10-21 19:42:12,479 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 21 [2021-10-21 19:42:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:12,479 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2021-10-21 19:42:12,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2021-10-21 19:42:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-21 19:42:12,481 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:12,481 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:12,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:42:12,481 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -234606263, now seen corresponding path program 1 times [2021-10-21 19:42:12,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:12,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545513503] [2021-10-21 19:42:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:12,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:12,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:12,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545513503] [2021-10-21 19:42:12,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545513503] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:12,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:12,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:12,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899454887] [2021-10-21 19:42:12,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:12,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:12,522 INFO L87 Difference]: Start difference. First operand 216 states and 266 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) [2021-10-21 19:42:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:12,637 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-10-21 19:42:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:42:12,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-21 19:42:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:12,639 INFO L225 Difference]: With dead ends: 217 [2021-10-21 19:42:12,639 INFO L226 Difference]: Without dead ends: 209 [2021-10-21 19:42:12,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-21 19:42:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2021-10-21 19:42:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 1.203883495145631) internal successors, (248), 207 states have internal predecessors, (248), 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) [2021-10-21 19:42:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2021-10-21 19:42:12,665 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 23 [2021-10-21 19:42:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:12,665 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2021-10-21 19:42:12,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) [2021-10-21 19:42:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2021-10-21 19:42:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-21 19:42:12,667 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:12,667 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:12,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:42:12,667 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash -900992014, now seen corresponding path program 1 times [2021-10-21 19:42:12,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:12,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036236047] [2021-10-21 19:42:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:12,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:12,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:12,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036236047] [2021-10-21 19:42:12,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036236047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:12,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:12,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:12,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677275730] [2021-10-21 19:42:12,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:12,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:12,712 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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) [2021-10-21 19:42:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:12,844 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2021-10-21 19:42:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:42:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-21 19:42:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:12,847 INFO L225 Difference]: With dead ends: 250 [2021-10-21 19:42:12,847 INFO L226 Difference]: Without dead ends: 248 [2021-10-21 19:42:12,848 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 44.8ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:42:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-21 19:42:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 110. [2021-10-21 19:42:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 109 states have internal predecessors, (128), 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) [2021-10-21 19:42:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-10-21 19:42:12,865 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 29 [2021-10-21 19:42:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:12,866 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-10-21 19:42:12,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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) [2021-10-21 19:42:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-10-21 19:42:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:42:12,867 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:12,867 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:12,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:42:12,868 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 5957045, now seen corresponding path program 1 times [2021-10-21 19:42:12,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:12,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502027382] [2021-10-21 19:42:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:12,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:12,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:12,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502027382] [2021-10-21 19:42:12,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502027382] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:12,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997116485] [2021-10-21 19:42:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:12,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:12,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:12,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:12,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 19:42:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:42:13,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:13,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997116485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:13,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:42:13,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-10-21 19:42:13,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158540312] [2021-10-21 19:42:13,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:13,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:42:13,331 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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) [2021-10-21 19:42:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:13,523 INFO L93 Difference]: Finished difference Result 399 states and 463 transitions. [2021-10-21 19:42:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:42:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-21 19:42:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:13,526 INFO L225 Difference]: With dead ends: 399 [2021-10-21 19:42:13,526 INFO L226 Difference]: Without dead ends: 293 [2021-10-21 19:42:13,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-10-21 19:42:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 256. [2021-10-21 19:42:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 254 states have (on average 1.188976377952756) internal successors, (302), 255 states have internal predecessors, (302), 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) [2021-10-21 19:42:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2021-10-21 19:42:13,573 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 31 [2021-10-21 19:42:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:13,573 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2021-10-21 19:42:13,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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) [2021-10-21 19:42:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2021-10-21 19:42:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:42:13,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:13,574 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:13,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-21 19:42:13,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-21 19:42:13,790 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash -971191967, now seen corresponding path program 1 times [2021-10-21 19:42:13,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:13,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922040267] [2021-10-21 19:42:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:13,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:13,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:13,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922040267] [2021-10-21 19:42:13,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922040267] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:13,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169277538] [2021-10-21 19:42:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:13,850 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:13,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:13,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 19:42:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-21 19:42:13,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:14,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169277538] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:14,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:42:14,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-10-21 19:42:14,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490086274] [2021-10-21 19:42:14,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:42:14,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:42:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:42:14,477 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:14,772 INFO L93 Difference]: Finished difference Result 517 states and 601 transitions. [2021-10-21 19:42:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:42:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-21 19:42:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:14,775 INFO L225 Difference]: With dead ends: 517 [2021-10-21 19:42:14,775 INFO L226 Difference]: Without dead ends: 295 [2021-10-21 19:42:14,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 127.3ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:42:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-21 19:42:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 220. [2021-10-21 19:42:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 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) [2021-10-21 19:42:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2021-10-21 19:42:14,840 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 40 [2021-10-21 19:42:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:14,841 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2021-10-21 19:42:14,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2021-10-21 19:42:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:42:14,842 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:14,842 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:14,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:15,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-21 19:42:15,056 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash -830643357, now seen corresponding path program 1 times [2021-10-21 19:42:15,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:15,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254553883] [2021-10-21 19:42:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:15,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:15,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:15,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254553883] [2021-10-21 19:42:15,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254553883] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:15,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191285148] [2021-10-21 19:42:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:15,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:15,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:15,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 19:42:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:15,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:42:15,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:15,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191285148] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:15,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:42:15,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-10-21 19:42:15,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086474610] [2021-10-21 19:42:15,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:15,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:15,602 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:15,795 INFO L93 Difference]: Finished difference Result 397 states and 459 transitions. [2021-10-21 19:42:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:42:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-21 19:42:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:15,797 INFO L225 Difference]: With dead ends: 397 [2021-10-21 19:42:15,797 INFO L226 Difference]: Without dead ends: 164 [2021-10-21 19:42:15,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:42:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-21 19:42:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2021-10-21 19:42:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 137 states have internal predecessors, (159), 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) [2021-10-21 19:42:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2021-10-21 19:42:15,824 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 40 [2021-10-21 19:42:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:15,825 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2021-10-21 19:42:15,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2021-10-21 19:42:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:42:15,826 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:15,826 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:15,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:16,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:16,046 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 34146378, now seen corresponding path program 1 times [2021-10-21 19:42:16,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:16,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482928091] [2021-10-21 19:42:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:16,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:16,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:16,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482928091] [2021-10-21 19:42:16,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482928091] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:16,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186212265] [2021-10-21 19:42:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:16,105 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:16,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:16,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-21 19:42:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:16,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-21 19:42:16,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-21 19:42:16,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186212265] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:16,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:16,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-10-21 19:42:16,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019323964] [2021-10-21 19:42:16,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:42:16,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:42:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:16,451 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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) [2021-10-21 19:42:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:17,382 INFO L93 Difference]: Finished difference Result 316 states and 359 transitions. [2021-10-21 19:42:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-21 19:42:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-21 19:42:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:17,384 INFO L225 Difference]: With dead ends: 316 [2021-10-21 19:42:17,384 INFO L226 Difference]: Without dead ends: 210 [2021-10-21 19:42:17,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 506.0ms TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2021-10-21 19:42:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-21 19:42:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2021-10-21 19:42:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 135 states have internal predecessors, (155), 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) [2021-10-21 19:42:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2021-10-21 19:42:17,410 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 45 [2021-10-21 19:42:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:17,410 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2021-10-21 19:42:17,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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) [2021-10-21 19:42:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2021-10-21 19:42:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-21 19:42:17,411 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:17,412 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:17,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:17,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:17,630 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:17,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1979695153, now seen corresponding path program 1 times [2021-10-21 19:42:17,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:17,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923592572] [2021-10-21 19:42:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:17,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:17,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:17,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923592572] [2021-10-21 19:42:17,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923592572] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:17,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729146954] [2021-10-21 19:42:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:17,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:17,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:17,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:17,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-21 19:42:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:17,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:42:17,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:18,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729146954] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:18,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:18,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-10-21 19:42:18,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60084465] [2021-10-21 19:42:18,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:42:18,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:18,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:42:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:42:18,362 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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) [2021-10-21 19:42:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:19,125 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2021-10-21 19:42:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-21 19:42:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 56 [2021-10-21 19:42:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:19,129 INFO L225 Difference]: With dead ends: 617 [2021-10-21 19:42:19,129 INFO L226 Difference]: Without dead ends: 429 [2021-10-21 19:42:19,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 327.7ms TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-10-21 19:42:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-21 19:42:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 318. [2021-10-21 19:42:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.1261829652996846) internal successors, (357), 317 states have internal predecessors, (357), 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) [2021-10-21 19:42:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 357 transitions. [2021-10-21 19:42:19,215 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 357 transitions. Word has length 56 [2021-10-21 19:42:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:19,216 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 357 transitions. [2021-10-21 19:42:19,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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) [2021-10-21 19:42:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 357 transitions. [2021-10-21 19:42:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-21 19:42:19,217 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:19,217 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:19,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:19,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-10-21 19:42:19,438 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash -56467119, now seen corresponding path program 1 times [2021-10-21 19:42:19,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:19,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579539005] [2021-10-21 19:42:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:19,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:19,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:19,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579539005] [2021-10-21 19:42:19,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579539005] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:19,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751177431] [2021-10-21 19:42:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:19,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:19,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:19,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-21 19:42:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:19,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-21 19:42:19,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:20,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751177431] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:20,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:20,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-10-21 19:42:20,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000373314] [2021-10-21 19:42:20,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:42:20,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:42:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:42:20,052 INFO L87 Difference]: Start difference. First operand 318 states and 357 transitions. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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) [2021-10-21 19:42:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:21,116 INFO L93 Difference]: Finished difference Result 670 states and 747 transitions. [2021-10-21 19:42:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-21 19:42:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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 56 [2021-10-21 19:42:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:21,122 INFO L225 Difference]: With dead ends: 670 [2021-10-21 19:42:21,122 INFO L226 Difference]: Without dead ends: 558 [2021-10-21 19:42:21,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 441.7ms TimeCoverageRelationStatistics Valid=416, Invalid=1066, Unknown=0, NotChecked=0, Total=1482 [2021-10-21 19:42:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-21 19:42:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 293. [2021-10-21 19:42:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.1267123287671232) internal successors, (329), 292 states have internal predecessors, (329), 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) [2021-10-21 19:42:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 329 transitions. [2021-10-21 19:42:21,191 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 329 transitions. Word has length 56 [2021-10-21 19:42:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:21,192 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 329 transitions. [2021-10-21 19:42:21,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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) [2021-10-21 19:42:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 329 transitions. [2021-10-21 19:42:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-21 19:42:21,193 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:42:21,193 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:21,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:21,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-21 19:42:21,418 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-10-21 19:42:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash 35100067, now seen corresponding path program 2 times [2021-10-21 19:42:21,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:21,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069236245] [2021-10-21 19:42:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:21,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:21,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:21,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069236245] [2021-10-21 19:42:21,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069236245] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:21,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39051637] [2021-10-21 19:42:21,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-21 19:42:21,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:21,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:21,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-21 19:42:21,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-21 19:42:21,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:21,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:42:21,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-21 19:42:22,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39051637] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:22,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:22,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2021-10-21 19:42:22,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10451284] [2021-10-21 19:42:22,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:42:22,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:22,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:42:22,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:42:22,248 INFO L87 Difference]: Start difference. First operand 293 states and 329 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 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) [2021-10-21 19:42:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:23,672 INFO L93 Difference]: Finished difference Result 427 states and 474 transitions. [2021-10-21 19:42:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-21 19:42:23,672 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 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 65 [2021-10-21 19:42:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:42:23,673 INFO L225 Difference]: With dead ends: 427 [2021-10-21 19:42:23,673 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 19:42:23,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 903.1ms TimeCoverageRelationStatistics Valid=531, Invalid=1361, Unknown=0, NotChecked=0, Total=1892 [2021-10-21 19:42:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 19:42:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 19:42:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2021-10-21 19:42:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 19:42:23,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-10-21 19:42:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:42:23,676 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:42:23,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 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) [2021-10-21 19:42:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:42:23,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 19:42:23,679 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,680 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,680 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,681 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,681 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,681 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,681 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,682 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,682 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,682 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,682 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,683 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,683 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,683 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:23,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-10-21 19:42:23,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:23,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 19:42:23,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:24,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:24,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:24,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:25,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:25,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:25,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:26,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:26,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:26,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:27,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:27,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:27,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:27,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:27,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:27,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:42:38,845 INFO L853 garLoopResultBuilder]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse20 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse13 (div ULTIMATE.start_main_~j~0 2)) (.cse5 (div .cse20 (- 2))) (.cse15 (* 2 ULTIMATE.start_main_~l~0)) (.cse6 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse0 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse16 (<= .cse6 (div ULTIMATE.start_main_~r~0 2))) (.cse17 (<= .cse15 ULTIMATE.start_main_~r~0)) (.cse7 (<= .cse5 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1))) (.cse9 (<= .cse15 ULTIMATE.start_main_~j~0)) (.cse18 (<= ULTIMATE.start_main_~i~0 .cse13)) (.cse10 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse19 (< (div (+ .cse20 1) (- 2)) .cse6)) (.cse11 (<= 2 ULTIMATE.start_main_~j~0)) (.cse12 (<= 1 ULTIMATE.start_main_~i~0)) (.cse1 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= ULTIMATE.start_main_~l~0 1)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= 1 ULTIMATE.start_main_~r~0)) (.cse14 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (<= 2 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7 .cse8 .cse9) (and .cse10 .cse11 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse0 .cse12 (<= .cse5 (+ .cse13 1)) .cse1 .cse2 .cse3 .cse4 .cse14 (<= ULTIMATE.start_main_~j~0 .cse15) .cse8) (and .cse16 .cse17 .cse12 .cse1 .cse3 .cse14 (<= (+ ULTIMATE.start_main_~r~0 5) (* 2 ULTIMATE.start_main_~n~0)) .cse8 .cse9 .cse18) (and (or (and .cse19 .cse17 .cse12 .cse1 .cse3 .cse14 .cse9) (and .cse16 .cse17 .cse12 .cse1 .cse3 .cse14 .cse7 .cse8 .cse9)) .cse8 .cse18) (and .cse10 .cse19 .cse11 .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse8))))) [2021-10-21 19:42:38,845 INFO L857 garLoopResultBuilder]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,845 INFO L853 garLoopResultBuilder]: At program point L18-20(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse7 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse8 (+ ULTIMATE.start_main_~l~0 1)) (.cse1 (<= 2 ULTIMATE.start_main_~j~0)) (.cse2 (<= 1 ULTIMATE.start_main_~i~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse9 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse10 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and .cse0 .cse1 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= (div .cse7 (- 2)) .cse8) .cse9 .cse10) (let ((.cse11 (* 2 ULTIMATE.start_main_~l~0))) (and (<= .cse11 ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse5 .cse9 .cse10 (<= .cse11 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (and .cse0 (< (div (+ .cse7 1) (- 2)) .cse8) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10))) [2021-10-21 19:42:38,846 INFO L857 garLoopResultBuilder]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,846 INFO L853 garLoopResultBuilder]: At program point L18-23(lines 17 22) the Hoare annotation is: (let ((.cse2 (<= 2 ULTIMATE.start_main_~j~0)) (.cse10 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse1 (+ ULTIMATE.start_main_~l~0 1)) (.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (< (div (+ .cse0 1) (- 2)) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (* 2 ULTIMATE.start_main_~l~0))) (and (<= .cse9 ULTIMATE.start_main_~r~0) .cse10 .cse3 .cse5 .cse7 (<= .cse9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (and .cse2 .cse10 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse3 .cse4 .cse5 .cse6 (<= (div .cse0 (- 2)) .cse1) .cse7 .cse8))) [2021-10-21 19:42:38,846 INFO L857 garLoopResultBuilder]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,846 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,846 INFO L853 garLoopResultBuilder]: At program point L18-26(lines 17 22) the Hoare annotation is: (let ((.cse2 (<= 2 ULTIMATE.start_main_~j~0)) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse1 (+ ULTIMATE.start_main_~l~0 1)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (< (div (+ .cse0 1) (- 2)) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse3 .cse4 .cse5 .cse6 (<= (div .cse0 (- 2)) .cse1) .cse7 .cse8) (let ((.cse9 (* 2 ULTIMATE.start_main_~l~0))) (and (<= .cse9 ULTIMATE.start_main_~r~0) .cse3 .cse5 .cse7 .cse8 (<= .cse9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))))) [2021-10-21 19:42:38,846 INFO L857 garLoopResultBuilder]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,847 INFO L853 garLoopResultBuilder]: At program point L18-29(lines 17 22) the Hoare annotation is: (let ((.cse19 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse17 (* 2 ULTIMATE.start_main_~n~0)) (.cse12 (* 2 ULTIMATE.start_main_~l~0)) (.cse18 (div ULTIMATE.start_main_~j~0 2)) (.cse15 (div (+ .cse19 1) (- 2))) (.cse7 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse1 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse6 (div .cse19 (- 2))) (.cse3 (<= ULTIMATE.start_main_~l~0 1)) (.cse5 (<= 1 ULTIMATE.start_main_~r~0)) (.cse10 (< .cse15 .cse7)) (.cse11 (+ .cse18 1)) (.cse13 (<= .cse12 ULTIMATE.start_main_~r~0)) (.cse0 (<= 2 ULTIMATE.start_main_~j~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ .cse12 ULTIMATE.start_main_~r~0) .cse17)) (.cse4 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse9 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse16 (<= ULTIMATE.start_main_~i~0 .cse18))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 .cse7) .cse8 (<= .cse6 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1)) .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (<= .cse6 .cse11) .cse2 .cse3 .cse4 .cse5 .cse8 (<= ULTIMATE.start_main_~j~0 .cse12) .cse9) (and .cse10 .cse13 .cse0 .cse2 .cse14 .cse4 (< .cse15 .cse11) .cse9 .cse16) (and .cse13 .cse0 .cse2 .cse14 .cse4 .cse8 (<= (+ ULTIMATE.start_main_~r~0 5) .cse17) .cse9 (<= .cse12 ULTIMATE.start_main_~j~0) .cse16))))) [2021-10-21 19:42:38,847 INFO L857 garLoopResultBuilder]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,847 INFO L857 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,847 INFO L857 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,847 INFO L853 garLoopResultBuilder]: At program point L18-32(lines 17 22) the Hoare annotation is: (let ((.cse5 (* 2 ULTIMATE.start_main_~n~0)) (.cse4 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse0 (<= .cse4 ULTIMATE.start_main_~r~0)) (.cse2 (<= 2 ULTIMATE.start_main_~l~0)) (.cse3 (<= (+ .cse4 ULTIMATE.start_main_~r~0) .cse5)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse7 (<= .cse4 ULTIMATE.start_main_~j~0)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse8 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse4 ULTIMATE.start_main_~r~0 1) .cse5) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse7 .cse8) (and (let ((.cse9 (<= ULTIMATE.start_main_~r~0 .cse4))) (or (and .cse0 .cse9 .cse2 .cse3 (<= (+ ULTIMATE.start_main_~r~0 2) ULTIMATE.start_main_~j~0) .cse6 .cse7) (and .cse0 .cse9 .cse2 .cse3 (<= ULTIMATE.start_main_~j~0 .cse4) .cse6 .cse7))) .cse1 .cse8)))) [2021-10-21 19:42:38,847 INFO L857 garLoopResultBuilder]: For program point L19-2(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,847 INFO L857 garLoopResultBuilder]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L857 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L857 garLoopResultBuilder]: For program point L19-4(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L853 garLoopResultBuilder]: At program point L18-35(lines 17 22) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~n~0)) (.cse2 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse0 (<= .cse2 ULTIMATE.start_main_~r~0)) (.cse1 (<= 2 ULTIMATE.start_main_~l~0)) (.cse5 (<= (+ .cse2 ULTIMATE.start_main_~r~0) (+ .cse3 2))) (.cse7 (<= .cse2 ULTIMATE.start_main_~j~0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse8 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2)))) (or (and .cse0 .cse1 (<= (+ .cse2 ULTIMATE.start_main_~r~0 1) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (and (or (and .cse0 .cse1 .cse5 (<= ULTIMATE.start_main_~j~0 .cse2) .cse7) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~r~0 2) ULTIMATE.start_main_~j~0) .cse5 .cse7)) .cse4 .cse6 .cse8)))) [2021-10-21 19:42:38,848 INFO L857 garLoopResultBuilder]: For program point L19-5(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L857 garLoopResultBuilder]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L857 garLoopResultBuilder]: For program point L19-6(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L857 garLoopResultBuilder]: For program point L19-7(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,848 INFO L853 garLoopResultBuilder]: At program point L18-38(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 2 ULTIMATE.start_main_~j~0)) (.cse1 (<= (+ (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (* 2 ULTIMATE.start_main_~n~0))) (.cse2 (<= ULTIMATE.start_main_~l~0 1)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= 1 ULTIMATE.start_main_~r~0)) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (div (* ULTIMATE.start_main_~r~0 (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse5 .cse6))) [2021-10-21 19:42:38,849 INFO L857 garLoopResultBuilder]: For program point L19-8(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,849 INFO L857 garLoopResultBuilder]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,849 INFO L857 garLoopResultBuilder]: For program point L19-9(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,849 INFO L857 garLoopResultBuilder]: For program point L19-10(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,849 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,849 INFO L853 garLoopResultBuilder]: At program point L18-41(lines 17 22) the Hoare annotation is: (let ((.cse2 (<= 2 ULTIMATE.start_main_~j~0)) (.cse8 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= (+ (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (* 2 ULTIMATE.start_main_~n~0))) (.cse4 (<= ULTIMATE.start_main_~l~0 1)) (.cse9 (<= 1 ULTIMATE.start_main_~l~0)) (.cse5 (<= 1 ULTIMATE.start_main_~r~0)) (.cse0 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse1 (+ ULTIMATE.start_main_~l~0 1)) (.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (< (div (+ .cse0 1) (- 2)) .cse1) .cse2 .cse3 (< 0 ULTIMATE.start_main_~l~0) .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2))) (and .cse2 .cse8 .cse3 .cse4 .cse9 .cse5 (<= (div .cse0 (- 2)) .cse1) .cse6 .cse7))) [2021-10-21 19:42:38,849 INFO L857 garLoopResultBuilder]: For program point L19-11(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,850 INFO L857 garLoopResultBuilder]: For program point L19-12(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,850 INFO L857 garLoopResultBuilder]: For program point L19-13(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,850 INFO L860 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2021-10-21 19:42:38,850 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 19:42:38,850 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,851 INFO L853 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse22 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse12 (div ULTIMATE.start_main_~j~0 2)) (.cse11 (div (+ .cse22 1) (- 2))) (.cse0 (+ ULTIMATE.start_main_~l~0 1)) (.cse5 (* 2 ULTIMATE.start_main_~n~0)) (.cse23 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse1 (div ULTIMATE.start_main_~r~0 2)) (.cse13 (<= ULTIMATE.start_main_~j~0 .cse23)) (.cse14 (<= (+ .cse23 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse5 ULTIMATE.start_main_~j~0))) (.cse7 (<= .cse23 ULTIMATE.start_main_~j~0)) (.cse20 (< .cse11 .cse0)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0)) (.cse9 (<= .cse23 ULTIMATE.start_main_~r~0)) (.cse21 (div .cse12 2)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse8 (<= ULTIMATE.start_main_~i~0 .cse12)) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse15 (<= 2 ULTIMATE.start_main_~j~0)) (.cse16 (<= (+ .cse23 ULTIMATE.start_main_~r~0) .cse5)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse18 (<= 1 ULTIMATE.start_main_~r~0)) (.cse19 (<= (div .cse22 (- 2)) .cse0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0))) (or (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~r~0 5) .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse10 (< .cse11 (+ .cse12 1)) .cse13 .cse14 .cse8) (and .cse2 .cse15 (< 0 (div (div (+ ULTIMATE.start_main_~j~0 (- 2)) 2) 2)) .cse16 .cse17 .cse3 .cse18 .cse19 .cse4 .cse6) (and .cse10 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse1) .cse13 .cse14 .cse6 .cse7 .cse8) (and .cse20 .cse15 .cse16 .cse17 .cse3 (< 0 .cse21) .cse18 .cse4 .cse6) (and (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) .cse20 .cse15 .cse10 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) .cse17 .cse3 .cse18 .cse4 .cse6) (and .cse2 .cse9 (< .cse11 (+ .cse21 1)) .cse3 .cse4 .cse6 .cse8) (and .cse2 .cse15 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse16 .cse17 .cse3 .cse18 .cse19 .cse4))))) [2021-10-21 19:42:38,851 INFO L857 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2021-10-21 19:42:38,851 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,851 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2021-10-21 19:42:38,852 INFO L857 garLoopResultBuilder]: For program point L39-1(lines 39 46) no Hoare annotation was computed. [2021-10-21 19:42:38,852 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,852 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 19:42:38,852 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,852 INFO L857 garLoopResultBuilder]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2021-10-21 19:42:38,852 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,853 INFO L857 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2021-10-21 19:42:38,853 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-10-21 19:42:38,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 19:42:38,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,854 INFO L857 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2021-10-21 19:42:38,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,854 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 19:42:38,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,855 INFO L857 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-10-21 19:42:38,855 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-21 19:42:38,855 INFO L857 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,855 INFO L853 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~j~0 2)) (.cse0 (* 2 ULTIMATE.start_main_~l~0)) (.cse16 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse11 (<= 2 ULTIMATE.start_main_~i~0)) (.cse13 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse3 (div (+ .cse16 1) (- 2))) (.cse9 (+ ULTIMATE.start_main_~l~0 1)) (.cse12 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse15 (<= ULTIMATE.start_main_~l~0 1)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse5 (<= ULTIMATE.start_main_~j~0 .cse0)) (.cse2 (* 2 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse14 (<= .cse0 ULTIMATE.start_main_~j~0)) (.cse7 (<= ULTIMATE.start_main_~i~0 .cse4))) (or (and (<= .cse0 ULTIMATE.start_main_~r~0) .cse1 (<= (+ .cse0 ULTIMATE.start_main_~r~0 1) .cse2) (< .cse3 (+ .cse4 1)) .cse5 .cse6 .cse7) (and .cse8 (<= .cse9 .cse10) .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse14 .cse7) (and .cse8 .cse11 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse12 .cse15 .cse13 (<= (div .cse16 (- 2)) .cse9) .cse6 .cse14) (and .cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse3 .cse9) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse12 .cse15 .cse6) (and .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse5 (<= (+ .cse0 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse2 ULTIMATE.start_main_~j~0)) .cse6 .cse14 .cse7)))) [2021-10-21 19:42:38,855 INFO L857 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,856 INFO L853 garLoopResultBuilder]: At program point L18-5(lines 17 22) the Hoare annotation is: (let ((.cse2 (* 2 ULTIMATE.start_main_~l~0)) (.cse20 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse21 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse3 (* 2 ULTIMATE.start_main_~n~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse8 (<= ULTIMATE.start_main_~i~0 .cse21)) (.cse4 (div (+ .cse20 1) (- 2))) (.cse0 (<= .cse2 ULTIMATE.start_main_~r~0)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse5 (+ .cse21 1)) (.cse6 (<= ULTIMATE.start_main_~j~0 .cse2)) (.cse12 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse14 (<= 2 ULTIMATE.start_main_~i~0)) (.cse18 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse15 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse16 (<= 1 ULTIMATE.start_main_~l~0)) (.cse13 (+ ULTIMATE.start_main_~l~0 1)) (.cse19 (div .cse20 (- 2))) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= .cse2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 (<= (+ .cse2 ULTIMATE.start_main_~r~0 1) .cse3) (< .cse4 .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse6 (<= (+ .cse2 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse3 ULTIMATE.start_main_~j~0)) .cse11 .cse8) (and .cse12 (<= .cse13 .cse10) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse7 .cse11 .cse8) (and .cse12 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse4 .cse13) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse15 .cse17 .cse7) (and .cse0 .cse9 .cse18 .cse1 (<= .cse19 .cse5) .cse17 .cse16 .cse6 .cse11) (and .cse12 .cse14 .cse18 .cse15 .cse17 .cse16 (<= .cse19 .cse13) (<= .cse19 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1)) .cse7 .cse11)))) [2021-10-21 19:42:38,856 INFO L857 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,856 INFO L853 garLoopResultBuilder]: At program point L18-8(lines 17 22) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~j~0 2)) (.cse0 (* 2 ULTIMATE.start_main_~l~0)) (.cse16 (* ULTIMATE.start_main_~r~0 (- 1)))) (let ((.cse11 (<= 2 ULTIMATE.start_main_~i~0)) (.cse13 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse3 (div (+ .cse16 1) (- 2))) (.cse9 (+ ULTIMATE.start_main_~l~0 1)) (.cse12 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse15 (<= ULTIMATE.start_main_~l~0 1)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse5 (<= ULTIMATE.start_main_~j~0 .cse0)) (.cse2 (* 2 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse14 (<= .cse0 ULTIMATE.start_main_~j~0)) (.cse7 (<= ULTIMATE.start_main_~i~0 .cse4))) (or (and (<= .cse0 ULTIMATE.start_main_~r~0) .cse1 (<= (+ .cse0 ULTIMATE.start_main_~r~0 1) .cse2) (< .cse3 (+ .cse4 1)) .cse5 .cse6 .cse7) (and .cse8 (<= .cse9 .cse10) .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse14 .cse7) (and .cse8 .cse11 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse12 .cse15 .cse13 (<= (div .cse16 (- 2)) .cse9) .cse6 .cse14) (and .cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse3 .cse9) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse12 .cse15 .cse6) (and .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse5 (<= (+ .cse0 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse2 ULTIMATE.start_main_~j~0)) .cse6 .cse14 .cse7)))) [2021-10-21 19:42:38,856 INFO L857 garLoopResultBuilder]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,857 INFO L853 garLoopResultBuilder]: At program point L18-11(lines 17 22) the Hoare annotation is: (let ((.cse2 (* 2 ULTIMATE.start_main_~l~0)) (.cse20 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse21 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse3 (* 2 ULTIMATE.start_main_~n~0)) (.cse10 (div ULTIMATE.start_main_~r~0 2)) (.cse8 (<= ULTIMATE.start_main_~i~0 .cse21)) (.cse4 (div (+ .cse20 1) (- 2))) (.cse0 (<= .cse2 ULTIMATE.start_main_~r~0)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse5 (+ .cse21 1)) (.cse6 (<= ULTIMATE.start_main_~j~0 .cse2)) (.cse12 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (.cse14 (<= 2 ULTIMATE.start_main_~i~0)) (.cse18 (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2))) (.cse15 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse16 (<= 1 ULTIMATE.start_main_~l~0)) (.cse13 (+ ULTIMATE.start_main_~l~0 1)) (.cse19 (div .cse20 (- 2))) (.cse7 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= .cse2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 (<= (+ .cse2 ULTIMATE.start_main_~r~0 1) .cse3) (< .cse4 .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse1 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse10) .cse6 (<= (+ .cse2 (* 2 ULTIMATE.start_main_~r~0)) (+ .cse3 ULTIMATE.start_main_~j~0)) .cse11 .cse8) (and .cse12 (<= .cse13 .cse10) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse7 .cse11 .cse8) (and .cse12 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< .cse4 .cse13) (<= 2 ULTIMATE.start_main_~j~0) .cse1 .cse15 .cse17 .cse7) (and .cse0 .cse9 .cse18 .cse1 (<= .cse19 .cse5) .cse17 .cse16 .cse6 .cse11) (and .cse12 .cse14 .cse18 .cse15 .cse17 .cse16 (<= .cse19 .cse13) (<= .cse19 (+ (div (+ (- 1) ULTIMATE.start_main_~j~0) 2) 1)) .cse7 .cse11)))) [2021-10-21 19:42:38,857 INFO L857 garLoopResultBuilder]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,857 INFO L853 garLoopResultBuilder]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse8 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse7 (<= .cse8 ULTIMATE.start_main_~j~0)) (.cse4 (* ULTIMATE.start_main_~r~0 (- 1))) (.cse5 (+ ULTIMATE.start_main_~l~0 1)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse0 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse1 (<= ULTIMATE.start_main_~l~0 1)) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= 1 ULTIMATE.start_main_~r~0)) (.cse10 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))) (or (and (<= 2 ULTIMATE.start_main_~i~0) (<= (div (* ULTIMATE.start_main_~i~0 (- 1)) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse0 .cse1 .cse2 .cse3 (<= (div .cse4 (- 2)) .cse5) .cse6 .cse7) (and (<= .cse8 ULTIMATE.start_main_~r~0) .cse9 .cse0 .cse2 .cse10 .cse6 .cse7 (<= ULTIMATE.start_main_~i~0 (div ULTIMATE.start_main_~j~0 2))) (and (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0) (< (div (+ .cse4 1) (- 2)) .cse5) (<= 2 ULTIMATE.start_main_~j~0) .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6)))) [2021-10-21 19:42:38,857 INFO L857 garLoopResultBuilder]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2021-10-21 19:42:38,858 INFO L857 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2021-10-21 19:42:38,862 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:42:38,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:42:38 BoogieIcfgContainer [2021-10-21 19:42:38,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:42:38,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:42:38,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:42:38,905 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:42:38,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:08" (3/4) ... [2021-10-21 19:42:38,908 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 19:42:38,922 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2021-10-21 19:42:38,922 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-21 19:42:38,923 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-21 19:42:38,923 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 19:42:38,988 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:42:38,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:42:38,990 INFO L168 Benchmark]: Toolchain (without parser) took 31198.23 ms. Allocated memory was 109.1 MB in the beginning and 285.2 MB in the end (delta: 176.2 MB). Free memory was 76.2 MB in the beginning and 156.2 MB in the end (delta: -80.0 MB). Peak memory consumption was 95.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,991 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 79.7 MB. Free memory is still 45.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:42:38,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.14 ms. Allocated memory is still 109.1 MB. Free memory was 76.0 MB in the beginning and 87.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.17 ms. Allocated memory is still 109.1 MB. Free memory was 87.6 MB in the beginning and 85.7 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:42:38,992 INFO L168 Benchmark]: Boogie Preprocessor took 29.05 ms. Allocated memory is still 109.1 MB. Free memory was 85.5 MB in the beginning and 84.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,992 INFO L168 Benchmark]: RCFGBuilder took 407.38 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 71.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,993 INFO L168 Benchmark]: TraceAbstraction took 30295.41 ms. Allocated memory was 109.1 MB in the beginning and 285.2 MB in the end (delta: 176.2 MB). Free memory was 70.9 MB in the beginning and 161.5 MB in the end (delta: -90.6 MB). Peak memory consumption was 162.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,993 INFO L168 Benchmark]: Witness Printer took 84.62 ms. Allocated memory is still 285.2 MB. Free memory was 161.5 MB in the beginning and 156.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,995 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 79.7 MB. Free memory is still 45.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.14 ms. Allocated memory is still 109.1 MB. Free memory was 76.0 MB in the beginning and 87.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.17 ms. Allocated memory is still 109.1 MB. Free memory was 87.6 MB in the beginning and 85.7 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.05 ms. Allocated memory is still 109.1 MB. Free memory was 85.5 MB in the beginning and 84.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 407.38 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 71.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30295.41 ms. Allocated memory was 109.1 MB in the beginning and 285.2 MB in the end (delta: 176.2 MB). Free memory was 70.9 MB in the beginning and 161.5 MB in the end (delta: -90.6 MB). Peak memory consumption was 162.1 MB. Max. memory is 16.1 GB. * Witness Printer took 84.62 ms. Allocated memory is still 285.2 MB. Free memory was 161.5 MB in the beginning and 156.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 30170.8ms, OverallIterations: 23, TraceHistogramMax: 3, EmptinessCheckTime: 46.4ms, AutomataDifference: 7221.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 14938.1ms, InitialAbstractionConstructionTime: 27.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1248 SDtfs, 3609 SDslu, 2455 SDs, 0 SdLazy, 3289 SolverSat, 1438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2821.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 2863.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=21, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 720.5ms AutomataMinimizationTime, 23 MinimizatonAttempts, 1672 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 292 NumberOfFragments, 2815 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1803881133 FormulaSimplificationTreeSizeReduction, 4343.7ms HoareSimplificationTime, 16 FomulaSimplificationsInter, 445769145 FormulaSimplificationTreeSizeReductionInter, 10576.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 96.0ms SsaConstructionTime, 519.6ms SatisfiabilityAnalysisTime, 3948.9ms InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 4849 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 139/306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((1 <= cond && 1 <= i) && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((((2 * l <= r && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r * -1 / -2 <= j / 2 + 1) && l <= 1) && 1 <= l) && j <= 2 * l) && 2 * l <= j)) || (((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((2 <= j && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) && i <= j / 2) || (((((((2 <= j && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((2 * l <= r && 1 <= cond) && 2 <= l) && 2 * l + r <= 2 * n) && 2 * l + r + 1 <= 2 * n) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) || (((((((((2 * l <= r && r <= 2 * l) && 2 <= l) && 2 * l + r <= 2 * n) && r + 2 <= j) && !(0 == cond)) && 2 * l <= j) || ((((((2 * l <= r && r <= 2 * l) && 2 <= l) && 2 * l + r <= 2 * n) && j <= 2 * l) && !(0 == cond)) && 2 * l <= j)) && 1 <= cond) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((2 <= i && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && !(0 == cond)) && 2 * l <= j) || (((((((2 * l <= r && 1 <= i) && j <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((l + 1 <= r / 2 && 2 <= i) && 1 <= l) && r <= n) && r + 5 <= 2 * n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) || (((((2 * l <= r && 1 <= i) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && i <= j / 2)) || (((((((((2 <= i && 2 <= j) && 0 < (j + -2) / 2 / 2) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond))) || ((((((1 <= i && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 0 < j / 2 / 2) && 1 <= r) && r <= n) && !(0 == cond))) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond))) || ((((((2 <= i && 2 * l <= r) && (r * -1 + 1) / -2 < j / 2 / 2 + 1) && 1 <= l) && r <= n) && !(0 == cond)) && i <= j / 2)) || (((((((((2 <= i && 2 <= j) && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && !(0 == cond)) && 2 * l <= j)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((1 <= i && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) || ((((((2 * l <= r && 1 <= cond) && j <= n) && 1 <= l) && r <= n) && 2 * l <= j) && i <= j / 2)) || (((((((((2 <= j && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((2 * l <= r && 2 <= l) && 2 * l + r + 1 <= 2 * n) && r <= n) && 2 * l + r <= 2 * n + 2) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) || ((((((((2 * l <= r && 2 <= l) && 2 * l + r <= 2 * n + 2) && j <= 2 * l) && 2 * l <= j) || ((((2 * l <= r && 2 <= l) && r + 2 <= j) && 2 * l + r <= 2 * n + 2) && 2 * l <= j)) && r <= n) && !(0 == cond)) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((2 <= j && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) || ((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond))) || ((((((((((2 <= j && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && r * -1 / -2 <= j / 2 + 1) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && j <= 2 * l) && !(0 == cond))) || (((((((((r * -1 + 1) / -2 < l + 1 && 2 * l <= r) && 2 <= j) && j <= n) && 2 * l + r <= 2 * n) && 1 <= l) && (r * -1 + 1) / -2 < j / 2 + 1) && !(0 == cond)) && i <= j / 2)) || (((((((((2 * l <= r && 2 <= j) && j <= n) && 2 * l + r <= 2 * n) && 1 <= l) && r <= n) && r + 5 <= 2 * n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && 2 * l + r <= 2 * n) && 0 < l) && l <= 1) && 1 <= r) && r <= n) && !(0 == cond)) || ((((((((2 <= j && 1 <= cond) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) && i <= j / 2)) || ((((((((2 <= j && 1 <= cond) && 2 * l + r <= 2 * n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((1 <= cond && 1 <= i) && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((((2 * l <= r && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r * -1 / -2 <= j / 2 + 1) && l <= 1) && 1 <= l) && j <= 2 * l) && 2 * l <= j)) || (((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((2 * l <= r && 1 <= i) && 2 * l + r + 1 <= 2 * n) && (r * -1 + 1) / -2 < j / 2 + 1) && j <= 2 * l) && !(0 == cond)) && i <= j / 2) || ((((((((j <= r && l + 1 <= r / 2) && 2 <= i) && j + 1 <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || ((((((((j <= r && 2 <= i) && i * -1 / -2 <= (n + -2) / 2) && j + 1 <= n) && l <= 1) && 1 <= l) && r * -1 / -2 <= l + 1) && !(0 == cond)) && 2 * l <= j)) || (((((((j <= r && i + 1 <= n) && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j + 1 <= n) && l <= 1) && !(0 == cond))) || ((((((1 <= i && j * -1 / -2 + 1 <= r / 2) && j <= 2 * l) && 2 * l + 2 * r <= 2 * n + j) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((2 <= i && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j) || ((((((((((((i + 1 <= n && 2 <= j) && 1 <= cond) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && r * -1 / -2 <= j / 2 + 1) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && j <= 2 * l) && !(0 == cond))) || (((((((((l + 1 <= r / 2 && 2 * l <= r) && 1 <= i) && j <= n) && 1 <= l) && r <= n) && r + 5 <= 2 * n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || ((((((((((r * -1 + 1) / -2 < l + 1 && 2 * l <= r) && 1 <= i) && j <= n) && 1 <= l) && r <= n) && 2 * l <= j) || ((((((((l + 1 <= r / 2 && 2 * l <= r) && 1 <= i) && j <= n) && 1 <= l) && r <= n) && r * -1 / -2 <= (-1 + j) / 2 + 1) && !(0 == cond)) && 2 * l <= j)) && !(0 == cond)) && i <= j / 2)) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((i + 1 <= n && 2 <= j) && i * -1 / -2 <= (n + -2) / 2) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond)) || (((((((2 * l <= r && 1 <= i) && j <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2)) || (((((((((i + 1 <= n && (r * -1 + 1) / -2 < l + 1) && 2 <= j) && 1 <= i) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((r * -1 + 1) / -2 < l + 1 && 2 <= j) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r <= n) && !(0 == cond)) || ((((((((2 <= j && i * -1 / -2 <= (n + -2) / 2) && j <= n) && l <= 1) && 1 <= l) && 1 <= r) && r * -1 / -2 <= l + 1) && r <= n) && !(0 == cond))) || ((((((2 * l <= r && j <= n) && 1 <= l) && r <= n) && !(0 == cond)) && 2 * l <= j) && i <= j / 2) RESULT: Ultimate proved your program to be correct! [2021-10-21 19:42:39,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b94e42bf-f622-4ff1-ac81-38d8bd195c80/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...