./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt --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 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:19:55,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:19:55,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:19:55,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:19:55,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:19:55,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:19:55,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:19:55,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:19:55,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:19:55,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:19:55,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:19:55,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:19:55,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:19:55,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:19:55,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:19:55,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:19:55,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:19:55,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:19:55,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:19:55,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:19:55,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:19:55,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:19:55,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:19:55,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:19:55,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:19:55,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:19:55,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:19:55,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:19:55,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:19:55,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:19:55,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:19:55,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:19:55,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:19:55,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:19:55,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:19:55,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:19:55,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:19:55,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:19:55,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:19:55,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:19:55,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:19:55,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:19:55,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:19:55,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:19:55,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:19:55,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:19:55,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:19:55,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:19:55,714 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:19:55,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:19:55,715 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:19:55,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:19:55,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:19:55,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:19:55,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:19:55,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:19:55,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:19:55,718 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:19:55,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:19:55,718 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:19:55,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:19:55,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:19:55,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:19:55,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:19:55,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:19:55,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:19:55,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:19:55,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:19:55,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:19:55,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:19:55,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:19:55,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:19:55,724 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_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/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_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt 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 -> 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f [2021-10-13 00:19:56,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:19:56,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:19:56,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:19:56,117 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:19:56,118 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:19:56,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/loop-invgen/heapsort.i [2021-10-13 00:19:56,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/data/926c8cd29/134a920f40a04dfb88f363d11bae9dc8/FLAG864851157 [2021-10-13 00:19:56,794 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:19:56,795 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/sv-benchmarks/c/loop-invgen/heapsort.i [2021-10-13 00:19:56,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/data/926c8cd29/134a920f40a04dfb88f363d11bae9dc8/FLAG864851157 [2021-10-13 00:19:57,134 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/data/926c8cd29/134a920f40a04dfb88f363d11bae9dc8 [2021-10-13 00:19:57,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:19:57,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:19:57,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:19:57,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:19:57,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:19:57,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72878218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57, skipping insertion in model container [2021-10-13 00:19:57,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:19:57,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:19:57,425 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_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-10-13 00:19:57,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:19:57,459 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:19:57,475 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_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-10-13 00:19:57,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:19:57,504 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:19:57,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57 WrapperNode [2021-10-13 00:19:57,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:19:57,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:19:57,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:19:57,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:19:57,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:19:57,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:19:57,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:19:57,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:19:57,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:19:57,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:19:57,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:19:57,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:19:57,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (1/1) ... [2021-10-13 00:19:57,610 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:19:57,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:57,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:57,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:19:57,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:19:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:19:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:19:57,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:19:58,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:19:58,080 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-10-13 00:19:58,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:58 BoogieIcfgContainer [2021-10-13 00:19:58,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:19:58,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:19:58,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:19:58,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:19:58,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:19:57" (1/3) ... [2021-10-13 00:19:58,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c31c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:58, skipping insertion in model container [2021-10-13 00:19:58,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:57" (2/3) ... [2021-10-13 00:19:58,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c31c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:58, skipping insertion in model container [2021-10-13 00:19:58,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:58" (3/3) ... [2021-10-13 00:19:58,102 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2021-10-13 00:19:58,124 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:19:58,125 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-10-13 00:19:58,229 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:19:58,237 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, mConcurrency=FINITE_AUTOMATA, 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-13 00:19:58,238 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-10-13 00:19:58,269 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-13 00:19:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:19:58,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:19:58,278 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:58,279 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-13 00:19:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1222313301, now seen corresponding path program 1 times [2021-10-13 00:19:58,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:58,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222354175] [2021-10-13 00:19:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:58,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:58,494 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-13 00:19:58,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:58,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222354175] [2021-10-13 00:19:58,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222354175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:58,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:58,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:19:58,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560525148] [2021-10-13 00:19:58,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 00:19:58,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:58,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 00:19:58,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:19:58,527 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-13 00:19:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:58,555 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2021-10-13 00:19:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 00:19:58,557 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-13 00:19:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:19:58,571 INFO L225 Difference]: With dead ends: 138 [2021-10-13 00:19:58,571 INFO L226 Difference]: Without dead ends: 67 [2021-10-13 00:19:58,575 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-13 00:19:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-13 00:19:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-10-13 00:19:58,619 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-13 00:19:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2021-10-13 00:19:58,623 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 9 [2021-10-13 00:19:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:19:58,624 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2021-10-13 00:19:58,625 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-13 00:19:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2021-10-13 00:19:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:19:58,626 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:19:58,626 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:58,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:19:58,627 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-13 00:19:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1218380889, now seen corresponding path program 1 times [2021-10-13 00:19:58,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:58,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107659005] [2021-10-13 00:19:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:58,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:58,788 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-13 00:19:58,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:58,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107659005] [2021-10-13 00:19:58,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107659005] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:58,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:58,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:19:58,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251051430] [2021-10-13 00:19:58,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:19:58,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:19:58,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:19:58,795 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-13 00:19:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:58,886 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-10-13 00:19:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:19:58,887 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-13 00:19:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:19:58,889 INFO L225 Difference]: With dead ends: 72 [2021-10-13 00:19:58,890 INFO L226 Difference]: Without dead ends: 70 [2021-10-13 00:19:58,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:19:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-13 00:19:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-10-13 00:19:58,901 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-13 00:19:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-10-13 00:19:58,903 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 9 [2021-10-13 00:19:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:19:58,904 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-10-13 00:19:58,904 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-13 00:19:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-10-13 00:19:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:19:58,906 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:19:58,906 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:58,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:19:58,907 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-13 00:19:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1218404721, now seen corresponding path program 1 times [2021-10-13 00:19:58,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:58,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490943762] [2021-10-13 00:19:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:58,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:58,986 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-13 00:19:58,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:58,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490943762] [2021-10-13 00:19:58,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490943762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:58,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:58,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:19:58,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174252536] [2021-10-13 00:19:58,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:19:58,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:19:58,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:19:58,992 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-13 00:19:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:59,108 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-10-13 00:19:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:19:59,109 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-13 00:19:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:19:59,110 INFO L225 Difference]: With dead ends: 72 [2021-10-13 00:19:59,110 INFO L226 Difference]: Without dead ends: 70 [2021-10-13 00:19:59,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:19:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-13 00:19:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2021-10-13 00:19:59,122 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-13 00:19:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-10-13 00:19:59,124 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2021-10-13 00:19:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:19:59,125 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-10-13 00:19:59,125 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-13 00:19:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-10-13 00:19:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:19:59,126 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:19:59,127 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:59,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:19:59,128 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-13 00:19:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1218310388, now seen corresponding path program 1 times [2021-10-13 00:19:59,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:59,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123494197] [2021-10-13 00:19:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:59,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:59,244 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-13 00:19:59,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:59,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123494197] [2021-10-13 00:19:59,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123494197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:59,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:59,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:19:59,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716658895] [2021-10-13 00:19:59,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:19:59,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:59,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:19:59,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:19:59,249 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-13 00:19:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:59,520 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2021-10-13 00:19:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:19:59,521 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-13 00:19:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:19:59,523 INFO L225 Difference]: With dead ends: 128 [2021-10-13 00:19:59,524 INFO L226 Difference]: Without dead ends: 120 [2021-10-13 00:19:59,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:19:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-10-13 00:19:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2021-10-13 00:19:59,539 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-13 00:19:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2021-10-13 00:19:59,542 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 9 [2021-10-13 00:19:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:19:59,543 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2021-10-13 00:19:59,543 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-13 00:19:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2021-10-13 00:19:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:19:59,545 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:19:59,545 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:59,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:19:59,546 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-13 00:19:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:59,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1661877060, now seen corresponding path program 1 times [2021-10-13 00:19:59,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:59,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993585395] [2021-10-13 00:19:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:59,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:59,629 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-13 00:19:59,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:59,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993585395] [2021-10-13 00:19:59,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993585395] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:59,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:59,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:19:59,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866907528] [2021-10-13 00:19:59,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:19:59,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:59,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:19:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:19:59,634 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-13 00:19:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:59,967 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2021-10-13 00:19:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:19:59,969 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-13 00:19:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:19:59,974 INFO L225 Difference]: With dead ends: 156 [2021-10-13 00:19:59,975 INFO L226 Difference]: Without dead ends: 154 [2021-10-13 00:19:59,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 60.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:19:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-10-13 00:20:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2021-10-13 00:20:00,020 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-13 00:20:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-10-13 00:20:00,028 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 11 [2021-10-13 00:20:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:00,029 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-10-13 00:20:00,030 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-13 00:20:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-10-13 00:20:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:20:00,032 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:00,032 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:00,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:20:00,033 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-13 00:20:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1638973740, now seen corresponding path program 1 times [2021-10-13 00:20:00,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200857594] [2021-10-13 00:20:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:00,101 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-13 00:20:00,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:00,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200857594] [2021-10-13 00:20:00,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200857594] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:00,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:00,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:20:00,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684929402] [2021-10-13 00:20:00,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:20:00,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:20:00,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:20:00,112 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-13 00:20:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:00,253 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2021-10-13 00:20:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:20:00,256 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-13 00:20:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:00,257 INFO L225 Difference]: With dead ends: 138 [2021-10-13 00:20:00,258 INFO L226 Difference]: Without dead ends: 136 [2021-10-13 00:20:00,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:20:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-10-13 00:20:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2021-10-13 00:20:00,295 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-13 00:20:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-10-13 00:20:00,298 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 11 [2021-10-13 00:20:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:00,298 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-10-13 00:20:00,299 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-13 00:20:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-10-13 00:20:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:20:00,302 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:00,302 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:00,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:20:00,303 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-13 00:20:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1729632713, now seen corresponding path program 1 times [2021-10-13 00:20:00,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17593959] [2021-10-13 00:20:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:00,425 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-13 00:20:00,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:00,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17593959] [2021-10-13 00:20:00,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17593959] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:00,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:00,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:20:00,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334017645] [2021-10-13 00:20:00,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:00,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:20:00,429 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-13 00:20:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:00,743 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2021-10-13 00:20:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:20:00,744 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-13 00:20:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:00,746 INFO L225 Difference]: With dead ends: 235 [2021-10-13 00:20:00,746 INFO L226 Difference]: Without dead ends: 229 [2021-10-13 00:20:00,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:20:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-10-13 00:20:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174. [2021-10-13 00:20:00,769 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-13 00:20:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2021-10-13 00:20:00,770 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 11 [2021-10-13 00:20:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:00,771 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2021-10-13 00:20:00,771 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-13 00:20:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2021-10-13 00:20:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:20:00,772 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:00,772 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:00,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:20:00,773 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-13 00:20:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1823743610, now seen corresponding path program 1 times [2021-10-13 00:20:00,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529153876] [2021-10-13 00:20:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:00,831 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-13 00:20:00,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:00,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529153876] [2021-10-13 00:20:00,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529153876] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:00,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:00,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:20:00,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722399573] [2021-10-13 00:20:00,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:20:00,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:20:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:20:00,835 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-13 00:20:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:00,875 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2021-10-13 00:20:00,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:20:00,876 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-13 00:20:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:00,878 INFO L225 Difference]: With dead ends: 375 [2021-10-13 00:20:00,878 INFO L226 Difference]: Without dead ends: 291 [2021-10-13 00:20:00,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:20:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-10-13 00:20:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2021-10-13 00:20:00,919 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-13 00:20:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2021-10-13 00:20:00,920 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 11 [2021-10-13 00:20:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:00,921 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2021-10-13 00:20:00,921 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-13 00:20:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2021-10-13 00:20:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:20:00,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:00,925 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:00,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:20:00,926 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-13 00:20:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1755987957, now seen corresponding path program 1 times [2021-10-13 00:20:00,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078328980] [2021-10-13 00:20:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:00,986 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-13 00:20:00,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:00,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078328980] [2021-10-13 00:20:00,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078328980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:00,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:00,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:20:00,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941642281] [2021-10-13 00:20:00,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:20:00,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:00,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:20:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:20:00,996 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-13 00:20:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:01,048 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2021-10-13 00:20:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:20:01,056 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-13 00:20:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:01,059 INFO L225 Difference]: With dead ends: 284 [2021-10-13 00:20:01,059 INFO L226 Difference]: Without dead ends: 240 [2021-10-13 00:20:01,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 00:20:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-13 00:20:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-10-13 00:20:01,081 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-13 00:20:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2021-10-13 00:20:01,084 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 11 [2021-10-13 00:20:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:01,085 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2021-10-13 00:20:01,085 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-13 00:20:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2021-10-13 00:20:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:20:01,087 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:01,087 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:01,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:20:01,087 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-13 00:20:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2105123171, now seen corresponding path program 1 times [2021-10-13 00:20:01,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:01,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282034707] [2021-10-13 00:20:01,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:01,191 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-13 00:20:01,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:01,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282034707] [2021-10-13 00:20:01,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282034707] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:01,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:01,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:20:01,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860533888] [2021-10-13 00:20:01,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:20:01,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:01,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:20:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:20:01,196 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-13 00:20:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:01,371 INFO L93 Difference]: Finished difference Result 380 states and 493 transitions. [2021-10-13 00:20:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:20:01,372 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-13 00:20:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:01,375 INFO L225 Difference]: With dead ends: 380 [2021-10-13 00:20:01,375 INFO L226 Difference]: Without dead ends: 372 [2021-10-13 00:20:01,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:20:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-13 00:20:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 200. [2021-10-13 00:20:01,399 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-13 00:20:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2021-10-13 00:20:01,400 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 15 [2021-10-13 00:20:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:01,401 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2021-10-13 00:20:01,401 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-13 00:20:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2021-10-13 00:20:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:20:01,402 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:01,402 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:01,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:20:01,402 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-13 00:20:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 639895389, now seen corresponding path program 1 times [2021-10-13 00:20:01,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:01,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580594981] [2021-10-13 00:20:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:01,445 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-13 00:20:01,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:01,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580594981] [2021-10-13 00:20:01,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580594981] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:01,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:01,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:20:01,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098608994] [2021-10-13 00:20:01,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:20:01,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:20:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:20:01,448 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-13 00:20:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:01,610 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2021-10-13 00:20:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:20:01,611 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-13 00:20:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:01,614 INFO L225 Difference]: With dead ends: 302 [2021-10-13 00:20:01,614 INFO L226 Difference]: Without dead ends: 300 [2021-10-13 00:20:01,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:20:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-13 00:20:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2021-10-13 00:20:01,640 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-13 00:20:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 312 transitions. [2021-10-13 00:20:01,642 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 312 transitions. Word has length 15 [2021-10-13 00:20:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:01,642 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 312 transitions. [2021-10-13 00:20:01,643 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-13 00:20:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 312 transitions. [2021-10-13 00:20:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:20:01,654 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:01,655 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:01,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:20:01,655 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-13 00:20:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1672864291, now seen corresponding path program 1 times [2021-10-13 00:20:01,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:01,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577429461] [2021-10-13 00:20:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:01,726 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-13 00:20:01,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:01,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577429461] [2021-10-13 00:20:01,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577429461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:01,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:01,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:20:01,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426255314] [2021-10-13 00:20:01,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:20:01,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:20:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:20:01,729 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-13 00:20:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:01,930 INFO L93 Difference]: Finished difference Result 734 states and 889 transitions. [2021-10-13 00:20:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:20:01,931 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-13 00:20:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:01,935 INFO L225 Difference]: With dead ends: 734 [2021-10-13 00:20:01,935 INFO L226 Difference]: Without dead ends: 556 [2021-10-13 00:20:01,940 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:20:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-10-13 00:20:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 246. [2021-10-13 00:20:01,977 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-13 00:20:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2021-10-13 00:20:01,979 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 16 [2021-10-13 00:20:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:01,980 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2021-10-13 00:20:01,980 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-13 00:20:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2021-10-13 00:20:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:20:01,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:01,981 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:01,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:20:01,981 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-13 00:20:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 759304320, now seen corresponding path program 1 times [2021-10-13 00:20:01,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:01,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835014343] [2021-10-13 00:20:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:02,080 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-13 00:20:02,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:02,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835014343] [2021-10-13 00:20:02,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835014343] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:02,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:02,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:20:02,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219109697] [2021-10-13 00:20:02,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:02,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:20:02,084 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-13 00:20:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:02,345 INFO L93 Difference]: Finished difference Result 380 states and 474 transitions. [2021-10-13 00:20:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:20:02,346 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-13 00:20:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:02,351 INFO L225 Difference]: With dead ends: 380 [2021-10-13 00:20:02,351 INFO L226 Difference]: Without dead ends: 378 [2021-10-13 00:20:02,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:20:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-13 00:20:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 308. [2021-10-13 00:20:02,399 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-13 00:20:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 392 transitions. [2021-10-13 00:20:02,401 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 392 transitions. Word has length 17 [2021-10-13 00:20:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:02,402 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 392 transitions. [2021-10-13 00:20:02,402 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-13 00:20:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 392 transitions. [2021-10-13 00:20:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:20:02,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:02,404 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-13 00:20:02,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:20:02,404 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-13 00:20:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash -750791926, now seen corresponding path program 1 times [2021-10-13 00:20:02,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:02,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288130433] [2021-10-13 00:20:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:02,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:02,497 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-13 00:20:02,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:02,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288130433] [2021-10-13 00:20:02,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288130433] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:02,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:02,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:20:02,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782721410] [2021-10-13 00:20:02,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:02,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:02,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:20:02,501 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-13 00:20:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:02,765 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2021-10-13 00:20:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:20:02,766 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-13 00:20:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:02,770 INFO L225 Difference]: With dead ends: 410 [2021-10-13 00:20:02,770 INFO L226 Difference]: Without dead ends: 406 [2021-10-13 00:20:02,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 63.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:20:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-10-13 00:20:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 216. [2021-10-13 00:20:02,815 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-13 00:20:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2021-10-13 00:20:02,817 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 21 [2021-10-13 00:20:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:02,818 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2021-10-13 00:20:02,819 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-13 00:20:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2021-10-13 00:20:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:20:02,820 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:02,820 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-13 00:20:02,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:20:02,821 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-13 00:20:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash -234606263, now seen corresponding path program 1 times [2021-10-13 00:20:02,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:02,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70973090] [2021-10-13 00:20:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:02,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:02,904 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-13 00:20:02,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:02,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70973090] [2021-10-13 00:20:02,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70973090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:02,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:02,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:20:02,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30926219] [2021-10-13 00:20:02,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:02,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:20:02,908 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-13 00:20:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:03,079 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-10-13 00:20:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:20:03,080 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-13 00:20:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:03,082 INFO L225 Difference]: With dead ends: 217 [2021-10-13 00:20:03,082 INFO L226 Difference]: Without dead ends: 209 [2021-10-13 00:20:03,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:20:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-13 00:20:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2021-10-13 00:20:03,117 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-13 00:20:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2021-10-13 00:20:03,119 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 23 [2021-10-13 00:20:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:03,119 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2021-10-13 00:20:03,120 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-13 00:20:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2021-10-13 00:20:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:20:03,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:03,122 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-13 00:20:03,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:20:03,122 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-13 00:20:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash -900992014, now seen corresponding path program 1 times [2021-10-13 00:20:03,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:03,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131678013] [2021-10-13 00:20:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:03,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:03,206 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-13 00:20:03,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:03,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131678013] [2021-10-13 00:20:03,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131678013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:03,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:03,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:20:03,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440695940] [2021-10-13 00:20:03,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:03,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:03,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:20:03,223 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-13 00:20:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:03,403 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2021-10-13 00:20:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:20:03,404 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-13 00:20:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:03,407 INFO L225 Difference]: With dead ends: 250 [2021-10-13 00:20:03,407 INFO L226 Difference]: Without dead ends: 248 [2021-10-13 00:20:03,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 55.5ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:20:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-13 00:20:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 110. [2021-10-13 00:20:03,429 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-13 00:20:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-10-13 00:20:03,430 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 29 [2021-10-13 00:20:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:03,430 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-10-13 00:20:03,431 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-13 00:20:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-10-13 00:20:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:20:03,432 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:03,432 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-13 00:20:03,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:20:03,433 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-13 00:20:03,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash 5957045, now seen corresponding path program 1 times [2021-10-13 00:20:03,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:03,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619586463] [2021-10-13 00:20:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:03,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:03,517 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-13 00:20:03,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:03,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619586463] [2021-10-13 00:20:03,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619586463] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:03,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560924684] [2021-10-13 00:20:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:03,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:03,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:03,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:03,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:20:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:03,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:20:03,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:03,913 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-13 00:20:03,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560924684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:03,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:20:03,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-10-13 00:20:03,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88138322] [2021-10-13 00:20:03,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:03,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:20:03,916 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-13 00:20:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:04,201 INFO L93 Difference]: Finished difference Result 399 states and 463 transitions. [2021-10-13 00:20:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:20:04,202 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-13 00:20:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:04,205 INFO L225 Difference]: With dead ends: 399 [2021-10-13 00:20:04,205 INFO L226 Difference]: Without dead ends: 293 [2021-10-13 00:20:04,206 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 87.2ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:20:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-10-13 00:20:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 256. [2021-10-13 00:20:04,261 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-13 00:20:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2021-10-13 00:20:04,263 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 31 [2021-10-13 00:20:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:04,263 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2021-10-13 00:20:04,263 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-13 00:20:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2021-10-13 00:20:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:20:04,265 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:04,266 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-13 00:20:04,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:20:04,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 00:20:04,492 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-13 00:20:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash -971191967, now seen corresponding path program 1 times [2021-10-13 00:20:04,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:04,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733678845] [2021-10-13 00:20:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:04,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:04,581 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-13 00:20:04,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:04,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733678845] [2021-10-13 00:20:04,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733678845] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:04,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053167142] [2021-10-13 00:20:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:04,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:04,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:04,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:20:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 00:20:04,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:05,365 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-13 00:20:05,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053167142] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:05,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:20:05,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-10-13 00:20:05,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110493308] [2021-10-13 00:20:05,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:20:05,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:20:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:20:05,370 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-13 00:20:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:05,739 INFO L93 Difference]: Finished difference Result 517 states and 601 transitions. [2021-10-13 00:20:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:20:05,740 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-13 00:20:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:05,742 INFO L225 Difference]: With dead ends: 517 [2021-10-13 00:20:05,743 INFO L226 Difference]: Without dead ends: 295 [2021-10-13 00:20:05,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 152.3ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:20:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-13 00:20:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 220. [2021-10-13 00:20:05,795 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-13 00:20:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2021-10-13 00:20:05,797 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 40 [2021-10-13 00:20:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:05,798 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2021-10-13 00:20:05,798 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-13 00:20:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2021-10-13 00:20:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:20:05,799 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:05,799 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-13 00:20:05,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:20:06,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 00:20:06,017 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-13 00:20:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -830643357, now seen corresponding path program 1 times [2021-10-13 00:20:06,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:06,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701348683] [2021-10-13 00:20:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:06,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:06,077 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-13 00:20:06,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:06,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701348683] [2021-10-13 00:20:06,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701348683] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:06,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726736296] [2021-10-13 00:20:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:06,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:06,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:06,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:06,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:20:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:06,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:20:06,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:06,675 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-13 00:20:06,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726736296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:06,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:20:06,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-10-13 00:20:06,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587133583] [2021-10-13 00:20:06,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:20:06,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:20:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:20:06,679 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-13 00:20:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:07,009 INFO L93 Difference]: Finished difference Result 397 states and 459 transitions. [2021-10-13 00:20:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:20:07,010 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-13 00:20:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:07,012 INFO L225 Difference]: With dead ends: 397 [2021-10-13 00:20:07,012 INFO L226 Difference]: Without dead ends: 164 [2021-10-13 00:20:07,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.1ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:20:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-13 00:20:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2021-10-13 00:20:07,063 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-13 00:20:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2021-10-13 00:20:07,074 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 40 [2021-10-13 00:20:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:07,075 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2021-10-13 00:20:07,075 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-13 00:20:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2021-10-13 00:20:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:20:07,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:07,076 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-13 00:20:07,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:20:07,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:07,277 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-13 00:20:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash 34146378, now seen corresponding path program 1 times [2021-10-13 00:20:07,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:07,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050255669] [2021-10-13 00:20:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:07,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:07,367 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-13 00:20:07,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:07,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050255669] [2021-10-13 00:20:07,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050255669] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:07,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872317178] [2021-10-13 00:20:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:07,369 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:07,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:07,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:07,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 00:20:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:07,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 00:20:07,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:07,722 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-13 00:20:07,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872317178] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:07,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:20:07,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-10-13 00:20:07,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704104535] [2021-10-13 00:20:07,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 00:20:07,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:07,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:20:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:20:07,730 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-13 00:20:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:08,907 INFO L93 Difference]: Finished difference Result 316 states and 359 transitions. [2021-10-13 00:20:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-13 00:20:08,908 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-13 00:20:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:08,909 INFO L225 Difference]: With dead ends: 316 [2021-10-13 00:20:08,909 INFO L226 Difference]: Without dead ends: 210 [2021-10-13 00:20:08,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 645.9ms TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 00:20:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-13 00:20:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2021-10-13 00:20:08,951 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-13 00:20:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2021-10-13 00:20:08,952 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 45 [2021-10-13 00:20:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:08,953 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2021-10-13 00:20:08,953 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-13 00:20:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2021-10-13 00:20:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-13 00:20:08,956 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:08,956 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-13 00:20:09,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:20:09,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:09,168 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-13 00:20:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1979695153, now seen corresponding path program 1 times [2021-10-13 00:20:09,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:09,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222945143] [2021-10-13 00:20:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:09,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:09,264 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-13 00:20:09,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:09,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222945143] [2021-10-13 00:20:09,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222945143] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:09,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872885707] [2021-10-13 00:20:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:09,266 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:09,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:09,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:09,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 00:20:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:09,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:20:09,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:10,096 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-13 00:20:10,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872885707] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:10,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:20:10,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-10-13 00:20:10,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64222872] [2021-10-13 00:20:10,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 00:20:10,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:10,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 00:20:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:20:10,102 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-13 00:20:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:11,103 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2021-10-13 00:20:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 00:20:11,104 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-13 00:20:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:11,108 INFO L225 Difference]: With dead ends: 617 [2021-10-13 00:20:11,108 INFO L226 Difference]: Without dead ends: 429 [2021-10-13 00:20:11,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 384.4ms TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-10-13 00:20:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-13 00:20:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 318. [2021-10-13 00:20:11,179 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-13 00:20:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 357 transitions. [2021-10-13 00:20:11,181 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 357 transitions. Word has length 56 [2021-10-13 00:20:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:11,182 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 357 transitions. [2021-10-13 00:20:11,182 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-13 00:20:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 357 transitions. [2021-10-13 00:20:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-13 00:20:11,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:11,184 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-13 00:20:11,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:20:11,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:11,408 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-13 00:20:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash -56467119, now seen corresponding path program 1 times [2021-10-13 00:20:11,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:11,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480398489] [2021-10-13 00:20:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:11,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:11,522 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-13 00:20:11,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:11,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480398489] [2021-10-13 00:20:11,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480398489] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:11,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025573053] [2021-10-13 00:20:11,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:11,522 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:11,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:11,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:11,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 00:20:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:11,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 00:20:11,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:12,122 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-13 00:20:12,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025573053] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:12,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:20:12,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-10-13 00:20:12,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110288434] [2021-10-13 00:20:12,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:20:12,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:20:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:20:12,126 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-13 00:20:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:13,429 INFO L93 Difference]: Finished difference Result 670 states and 747 transitions. [2021-10-13 00:20:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-13 00:20:13,430 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-13 00:20:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:13,434 INFO L225 Difference]: With dead ends: 670 [2021-10-13 00:20:13,435 INFO L226 Difference]: Without dead ends: 558 [2021-10-13 00:20:13,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 564.3ms TimeCoverageRelationStatistics Valid=416, Invalid=1066, Unknown=0, NotChecked=0, Total=1482 [2021-10-13 00:20:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-13 00:20:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 293. [2021-10-13 00:20:13,541 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-13 00:20:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 329 transitions. [2021-10-13 00:20:13,543 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 329 transitions. Word has length 56 [2021-10-13 00:20:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:13,546 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 329 transitions. [2021-10-13 00:20:13,546 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-13 00:20:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 329 transitions. [2021-10-13 00:20:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-13 00:20:13,547 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:20:13,548 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-13 00:20:13,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-13 00:20:13,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-13 00:20:13,772 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-13 00:20:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 35100067, now seen corresponding path program 2 times [2021-10-13 00:20:13,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:13,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957444591] [2021-10-13 00:20:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:13,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:20:13,880 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-13 00:20:13,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:13,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957444591] [2021-10-13 00:20:13,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957444591] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:13,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211302100] [2021-10-13 00:20:13,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:20:13,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:13,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:13,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:13,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 00:20:14,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:20:14,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:20:14,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:20:14,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:14,743 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-13 00:20:14,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211302100] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:20:14,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:20:14,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2021-10-13 00:20:14,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574896679] [2021-10-13 00:20:14,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:20:14,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:20:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:20:14,746 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-13 00:20:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:16,274 INFO L93 Difference]: Finished difference Result 427 states and 474 transitions. [2021-10-13 00:20:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-13 00:20:16,274 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-13 00:20:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:20:16,275 INFO L225 Difference]: With dead ends: 427 [2021-10-13 00:20:16,275 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:20:16,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 929.0ms TimeCoverageRelationStatistics Valid=531, Invalid=1361, Unknown=0, NotChecked=0, Total=1892 [2021-10-13 00:20:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:20:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:20:16,278 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-13 00:20:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:20:16,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-10-13 00:20:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:20:16,279 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:20:16,279 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-13 00:20:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:20:16,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:20:16,283 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,283 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,284 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,284 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,284 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:20:16,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 00:20:16,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-10-13 00:20:16,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 00:20:16,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:16,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:17,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:17,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:18,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:18,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:18,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:19,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:19,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:20,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:20,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:20,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:20,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:20,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:21,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:21,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:20:34,326 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-13 00:20:34,327 INFO L857 garLoopResultBuilder]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,327 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-13 00:20:34,328 INFO L857 garLoopResultBuilder]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,328 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-13 00:20:34,328 INFO L857 garLoopResultBuilder]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,329 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-13 00:20:34,329 INFO L857 garLoopResultBuilder]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,329 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-13 00:20:34,330 INFO L857 garLoopResultBuilder]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,330 INFO L857 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,330 INFO L857 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,330 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-13 00:20:34,332 INFO L857 garLoopResultBuilder]: For program point L19-2(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,332 INFO L857 garLoopResultBuilder]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,333 INFO L857 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,333 INFO L857 garLoopResultBuilder]: For program point L19-4(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,333 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-13 00:20:34,333 INFO L857 garLoopResultBuilder]: For program point L19-5(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,333 INFO L857 garLoopResultBuilder]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,333 INFO L857 garLoopResultBuilder]: For program point L19-6(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,334 INFO L857 garLoopResultBuilder]: For program point L19-7(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,334 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-13 00:20:34,334 INFO L857 garLoopResultBuilder]: For program point L19-8(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,334 INFO L857 garLoopResultBuilder]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,334 INFO L857 garLoopResultBuilder]: For program point L19-9(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,334 INFO L857 garLoopResultBuilder]: For program point L19-10(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,335 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,335 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-13 00:20:34,335 INFO L857 garLoopResultBuilder]: For program point L19-11(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,335 INFO L857 garLoopResultBuilder]: For program point L19-12(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,335 INFO L857 garLoopResultBuilder]: For program point L19-13(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,335 INFO L860 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2021-10-13 00:20:34,336 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 00:20:34,336 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,336 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-13 00:20:34,336 INFO L857 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2021-10-13 00:20:34,336 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,336 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point L39-1(lines 39 46) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2021-10-13 00:20:34,337 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-10-13 00:20:34,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-13 00:20:34,339 INFO L857 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,339 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-13 00:20:34,339 INFO L857 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,339 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-13 00:20:34,339 INFO L857 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,339 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-13 00:20:34,340 INFO L857 garLoopResultBuilder]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,340 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-13 00:20:34,340 INFO L857 garLoopResultBuilder]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,340 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-13 00:20:34,340 INFO L857 garLoopResultBuilder]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2021-10-13 00:20:34,340 INFO L857 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2021-10-13 00:20:34,345 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:20:34,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:20:34 BoogieIcfgContainer [2021-10-13 00:20:34,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:20:34,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:20:34,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:20:34,431 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:20:34,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:58" (3/4) ... [2021-10-13 00:20:34,436 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:20:34,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2021-10-13 00:20:34,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 00:20:34,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-13 00:20:34,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:20:34,538 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:20:34,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:20:34,540 INFO L168 Benchmark]: Toolchain (without parser) took 37399.99 ms. Allocated memory was 92.3 MB in the beginning and 234.9 MB in the end (delta: 142.6 MB). Free memory was 56.7 MB in the beginning and 208.9 MB in the end (delta: -152.2 MB). Peak memory consumption was 128.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:20:34,541 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 92.3 MB. Free memory was 72.9 MB in the beginning and 72.8 MB in the end (delta: 55.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:20:34,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.46 ms. Allocated memory is still 92.3 MB. Free memory was 56.5 MB in the beginning and 67.9 MB in the end (delta: -11.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:20:34,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.05 ms. Allocated memory is still 92.3 MB. Free memory was 67.9 MB in the beginning and 65.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:20:34,543 INFO L168 Benchmark]: Boogie Preprocessor took 35.20 ms. Allocated memory is still 92.3 MB. Free memory was 65.9 MB in the beginning and 64.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:20:34,543 INFO L168 Benchmark]: RCFGBuilder took 484.85 ms. Allocated memory is still 92.3 MB. Free memory was 64.6 MB in the beginning and 51.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:20:34,544 INFO L168 Benchmark]: TraceAbstraction took 36336.86 ms. Allocated memory was 92.3 MB in the beginning and 234.9 MB in the end (delta: 142.6 MB). Free memory was 51.5 MB in the beginning and 76.2 MB in the end (delta: -24.7 MB). Peak memory consumption was 129.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:20:34,544 INFO L168 Benchmark]: Witness Printer took 107.68 ms. Allocated memory is still 234.9 MB. Free memory was 76.2 MB in the beginning and 208.9 MB in the end (delta: -132.7 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:20:34,547 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.40 ms. Allocated memory is still 92.3 MB. Free memory was 72.9 MB in the beginning and 72.8 MB in the end (delta: 55.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 364.46 ms. Allocated memory is still 92.3 MB. Free memory was 56.5 MB in the beginning and 67.9 MB in the end (delta: -11.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.05 ms. Allocated memory is still 92.3 MB. Free memory was 67.9 MB in the beginning and 65.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.20 ms. Allocated memory is still 92.3 MB. Free memory was 65.9 MB in the beginning and 64.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 484.85 ms. Allocated memory is still 92.3 MB. Free memory was 64.6 MB in the beginning and 51.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 36336.86 ms. Allocated memory was 92.3 MB in the beginning and 234.9 MB in the end (delta: 142.6 MB). Free memory was 51.5 MB in the beginning and 76.2 MB in the end (delta: -24.7 MB). Peak memory consumption was 129.1 MB. Max. memory is 16.1 GB. * Witness Printer took 107.68 ms. Allocated memory is still 234.9 MB. Free memory was 76.2 MB in the beginning and 208.9 MB in the end (delta: -132.7 MB). Peak memory consumption was 6.8 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: 36118.0ms, OverallIterations: 23, TraceHistogramMax: 3, EmptinessCheckTime: 57.9ms, AutomataDifference: 9008.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 17825.4ms, InitialAbstractionConstructionTime: 20.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1248 SDtfs, 3609 SDslu, 2455 SDs, 0 SdLazy, 3289 SolverSat, 1438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3626.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 3386.3ms 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: 868.3ms AutomataMinimizationTime, 23 MinimizatonAttempts, 1672 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 292 NumberOfFragments, 2815 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1803881133 FormulaSimplificationTreeSizeReduction, 5362.0ms HoareSimplificationTime, 16 FomulaSimplificationsInter, 445769145 FormulaSimplificationTreeSizeReductionInter, 12442.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 121.8ms SsaConstructionTime, 619.5ms SatisfiabilityAnalysisTime, 4824.7ms 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-13 00:20:34,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ae74fe-f6c2-462b-a3dd-0171f2177ba1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...