./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --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_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/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_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/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_f70b76fb-2880-4617-a771-e32561ea83d8/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 4bf978f501147b566a0f6f3e817c934f24352e71 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:16:39,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:16:39,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:16:39,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:16:39,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:16:39,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:16:39,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:16:39,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:16:39,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:16:39,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:16:39,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:16:39,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:16:39,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:16:39,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:16:39,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:16:39,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:16:39,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:16:39,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:16:39,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:16:39,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:16:39,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:16:39,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:16:39,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:16:39,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:16:39,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:16:39,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:16:39,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:16:39,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:16:39,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:16:39,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:16:39,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:16:39,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:16:39,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:16:39,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:16:39,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:16:39,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:16:39,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:16:39,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:16:39,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:16:39,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:16:39,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:16:39,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:16:39,364 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:16:39,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:16:39,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:16:39,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:16:39,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:16:39,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:16:39,366 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:16:39,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:16:39,367 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:16:39,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:16:39,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:16:39,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:16:39,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:16:39,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:16:39,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:16:39,369 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:16:39,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:16:39,369 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:16:39,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:16:39,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:16:39,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:16:39,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:16:39,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:16:39,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:16:39,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:16:39,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:16:39,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:16:39,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:16:39,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:16:39,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:16:39,373 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_f70b76fb-2880-4617-a771-e32561ea83d8/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_f70b76fb-2880-4617-a771-e32561ea83d8/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 -> 4bf978f501147b566a0f6f3e817c934f24352e71 [2021-10-13 00:16:39,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:16:39,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:16:39,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:16:39,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:16:39,713 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:16:39,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-10-13 00:16:39,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/data/8483f5719/948b9573eece4722b758e9e67ac50b1e/FLAG3658bd1e5 [2021-10-13 00:16:40,397 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:16:40,402 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2021-10-13 00:16:40,414 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/data/8483f5719/948b9573eece4722b758e9e67ac50b1e/FLAG3658bd1e5 [2021-10-13 00:16:40,735 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/data/8483f5719/948b9573eece4722b758e9e67ac50b1e [2021-10-13 00:16:40,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:16:40,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:16:40,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:16:40,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:16:40,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:16:40,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:16:40" (1/1) ... [2021-10-13 00:16:40,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ffe09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:40, skipping insertion in model container [2021-10-13 00:16:40,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:16:40" (1/1) ... [2021-10-13 00:16:40,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:16:40,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:16:41,100 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_f70b76fb-2880-4617-a771-e32561ea83d8/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2021-10-13 00:16:41,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:16:41,112 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:16:41,221 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_f70b76fb-2880-4617-a771-e32561ea83d8/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2021-10-13 00:16:41,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:16:41,252 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:16:41,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41 WrapperNode [2021-10-13 00:16:41,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:16:41,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:16:41,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:16:41,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:16:41,263 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:16:41" (1/1) ... [2021-10-13 00:16:41,278 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:16:41" (1/1) ... [2021-10-13 00:16:41,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:16:41,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:16:41,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:16:41,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:16:41,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:16:41,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:16:41,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:16:41,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:16:41,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (1/1) ... [2021-10-13 00:16:41,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:16:41,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:16:41,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:16:41,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:16:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:16:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:16:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:16:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:16:41,756 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,765 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,777 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,801 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,812 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,821 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,829 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,838 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,856 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,862 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,882 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:41,917 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:16:42,848 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-13 00:16:42,849 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-10-13 00:16:42,850 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-10-13 00:16:42,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-10-13 00:16:42,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-10-13 00:16:42,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-10-13 00:16:42,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-10-13 00:16:42,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-10-13 00:16:42,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-10-13 00:16:42,862 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:16:42,862 INFO L299 CfgBuilder]: Removed 154 assume(true) statements. [2021-10-13 00:16:42,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:42 BoogieIcfgContainer [2021-10-13 00:16:42,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:16:42,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:16:42,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:16:42,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:16:42,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:16:40" (1/3) ... [2021-10-13 00:16:42,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461b829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:16:42, skipping insertion in model container [2021-10-13 00:16:42,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:41" (2/3) ... [2021-10-13 00:16:42,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461b829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:16:42, skipping insertion in model container [2021-10-13 00:16:42,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:42" (3/3) ... [2021-10-13 00:16:42,874 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2021-10-13 00:16:42,879 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:16:42,880 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-10-13 00:16:42,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:16:42,940 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:16:42,940 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-10-13 00:16:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 299 states have (on average 1.645484949832776) internal successors, (492), 329 states have internal predecessors, (492), 0 states have call successors, (0), 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:16:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:16:42,970 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:42,970 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:42,971 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2021-10-13 00:16:42,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:42,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538807030] [2021-10-13 00:16:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:42,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:43,242 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:16:43,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:43,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538807030] [2021-10-13 00:16:43,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538807030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:43,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:43,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:43,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456548523] [2021-10-13 00:16:43,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:43,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:43,286 INFO L87 Difference]: Start difference. First operand has 330 states, 299 states have (on average 1.645484949832776) internal successors, (492), 329 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.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:16:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:43,446 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2021-10-13 00:16:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:43,448 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:16:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:43,461 INFO L225 Difference]: With dead ends: 578 [2021-10-13 00:16:43,462 INFO L226 Difference]: Without dead ends: 324 [2021-10-13 00:16:43,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-13 00:16:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-10-13 00:16:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 323 states have internal predecessors, (442), 0 states have call successors, (0), 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:16:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2021-10-13 00:16:43,538 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2021-10-13 00:16:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:43,538 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2021-10-13 00:16:43,539 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:16:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2021-10-13 00:16:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:16:43,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:43,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:43,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:16:43,541 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:43,542 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2021-10-13 00:16:43,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:43,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438459713] [2021-10-13 00:16:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:43,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:43,618 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:16:43,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:43,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438459713] [2021-10-13 00:16:43,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438459713] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:43,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:43,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:43,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059682524] [2021-10-13 00:16:43,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:43,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:43,627 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:43,845 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2021-10-13 00:16:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:43,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:16:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:43,851 INFO L225 Difference]: With dead ends: 433 [2021-10-13 00:16:43,852 INFO L226 Difference]: Without dead ends: 368 [2021-10-13 00:16:43,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-13 00:16:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2021-10-13 00:16:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 331 states have (on average 1.447129909365559) internal successors, (479), 350 states have internal predecessors, (479), 0 states have call successors, (0), 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:16:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2021-10-13 00:16:43,908 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2021-10-13 00:16:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:43,908 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2021-10-13 00:16:43,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2021-10-13 00:16:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:16:43,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:43,910 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:43,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:16:43,911 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2021-10-13 00:16:43,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:43,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532445651] [2021-10-13 00:16:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:43,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:44,020 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:16:44,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:44,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532445651] [2021-10-13 00:16:44,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532445651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:44,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:44,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:44,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468020158] [2021-10-13 00:16:44,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:44,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:44,028 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:16:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:44,105 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2021-10-13 00:16:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:16:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:44,108 INFO L225 Difference]: With dead ends: 554 [2021-10-13 00:16:44,108 INFO L226 Difference]: Without dead ends: 362 [2021-10-13 00:16:44,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-13 00:16:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2021-10-13 00:16:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 295 states have (on average 1.4271186440677965) internal successors, (421), 306 states have internal predecessors, (421), 0 states have call successors, (0), 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:16:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2021-10-13 00:16:44,138 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2021-10-13 00:16:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:44,138 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2021-10-13 00:16:44,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:16:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2021-10-13 00:16:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:16:44,147 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:44,147 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:16:44,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:16:44,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2021-10-13 00:16:44,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:44,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228546593] [2021-10-13 00:16:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:44,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:44,253 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:16:44,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:44,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228546593] [2021-10-13 00:16:44,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228546593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:44,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:44,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:44,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433949010] [2021-10-13 00:16:44,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:44,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:44,262 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:16:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:44,397 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2021-10-13 00:16:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:16:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:44,401 INFO L225 Difference]: With dead ends: 307 [2021-10-13 00:16:44,401 INFO L226 Difference]: Without dead ends: 293 [2021-10-13 00:16:44,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-10-13 00:16:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-10-13 00:16:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 288 states have (on average 1.4131944444444444) internal successors, (407), 292 states have internal predecessors, (407), 0 states have call successors, (0), 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:16:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2021-10-13 00:16:44,422 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2021-10-13 00:16:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:44,423 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2021-10-13 00:16:44,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:16:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2021-10-13 00:16:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 00:16:44,426 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:44,426 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, 1, 1, 1, 1, 1] [2021-10-13 00:16:44,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:16:44,427 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2021-10-13 00:16:44,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:44,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124323820] [2021-10-13 00:16:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:44,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:44,583 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:16:44,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:44,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124323820] [2021-10-13 00:16:44,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124323820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:44,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:44,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:44,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432694911] [2021-10-13 00:16:44,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:44,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:44,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:44,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:44,587 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:16:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:44,743 INFO L93 Difference]: Finished difference Result 318 states and 435 transitions. [2021-10-13 00:16:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-13 00:16:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:44,751 INFO L225 Difference]: With dead ends: 318 [2021-10-13 00:16:44,751 INFO L226 Difference]: Without dead ends: 309 [2021-10-13 00:16:44,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-13 00:16:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2021-10-13 00:16:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 300 states have (on average 1.4066666666666667) internal successors, (422), 304 states have internal predecessors, (422), 0 states have call successors, (0), 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:16:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2021-10-13 00:16:44,779 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 26 [2021-10-13 00:16:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:44,779 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2021-10-13 00:16:44,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:16:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2021-10-13 00:16:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:16:44,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:44,782 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, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:44,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:16:44,782 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2021-10-13 00:16:44,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:44,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901073116] [2021-10-13 00:16:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:44,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:44,851 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:16:44,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:44,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901073116] [2021-10-13 00:16:44,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901073116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:44,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:44,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:44,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853610747] [2021-10-13 00:16:44,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:44,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:44,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:44,854 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:16:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:44,971 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2021-10-13 00:16:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 00:16:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:44,974 INFO L225 Difference]: With dead ends: 349 [2021-10-13 00:16:44,974 INFO L226 Difference]: Without dead ends: 302 [2021-10-13 00:16:44,974 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:16:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-13 00:16:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2021-10-13 00:16:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 301 states have internal predecessors, (418), 0 states have call successors, (0), 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:16:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 418 transitions. [2021-10-13 00:16:44,997 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 418 transitions. Word has length 27 [2021-10-13 00:16:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:44,997 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 418 transitions. [2021-10-13 00:16:44,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:16:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 418 transitions. [2021-10-13 00:16:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:16:44,999 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:44,999 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, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:44,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:16:45,000 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2021-10-13 00:16:45,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:45,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122899056] [2021-10-13 00:16:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:45,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:45,060 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:16:45,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:45,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122899056] [2021-10-13 00:16:45,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122899056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:45,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:45,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:45,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725846903] [2021-10-13 00:16:45,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:45,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:45,063 INFO L87 Difference]: Start difference. First operand 302 states and 418 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:16:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:45,098 INFO L93 Difference]: Finished difference Result 366 states and 498 transitions. [2021-10-13 00:16:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 00:16:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:45,102 INFO L225 Difference]: With dead ends: 366 [2021-10-13 00:16:45,102 INFO L226 Difference]: Without dead ends: 315 [2021-10-13 00:16:45,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-13 00:16:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2021-10-13 00:16:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 298 states have (on average 1.3993288590604027) internal successors, (417), 301 states have internal predecessors, (417), 0 states have call successors, (0), 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:16:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 417 transitions. [2021-10-13 00:16:45,127 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 417 transitions. Word has length 27 [2021-10-13 00:16:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:45,128 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 417 transitions. [2021-10-13 00:16:45,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:16:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 417 transitions. [2021-10-13 00:16:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:16:45,130 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:45,130 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, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:45,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:16:45,130 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 476963846, now seen corresponding path program 1 times [2021-10-13 00:16:45,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:45,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262210318] [2021-10-13 00:16:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:45,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:45,234 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:16:45,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:45,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262210318] [2021-10-13 00:16:45,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262210318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:45,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:45,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:45,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423876829] [2021-10-13 00:16:45,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:45,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:45,238 INFO L87 Difference]: Start difference. First operand 302 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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:16:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:45,381 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2021-10-13 00:16:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:45,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 00:16:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:45,385 INFO L225 Difference]: With dead ends: 310 [2021-10-13 00:16:45,385 INFO L226 Difference]: Without dead ends: 306 [2021-10-13 00:16:45,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:16:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-13 00:16:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2021-10-13 00:16:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 298 states have (on average 1.395973154362416) internal successors, (416), 301 states have internal predecessors, (416), 0 states have call successors, (0), 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:16:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2021-10-13 00:16:45,409 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 27 [2021-10-13 00:16:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:45,410 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2021-10-13 00:16:45,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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:16:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2021-10-13 00:16:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 00:16:45,414 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:45,414 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:45,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:16:45,414 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1894183263, now seen corresponding path program 1 times [2021-10-13 00:16:45,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:45,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967375689] [2021-10-13 00:16:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:45,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:45,465 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:16:45,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:45,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967375689] [2021-10-13 00:16:45,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967375689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:45,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:45,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:45,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029413419] [2021-10-13 00:16:45,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:45,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:45,468 INFO L87 Difference]: Start difference. First operand 302 states and 416 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:16:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:45,502 INFO L93 Difference]: Finished difference Result 319 states and 437 transitions. [2021-10-13 00:16:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-13 00:16:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:45,505 INFO L225 Difference]: With dead ends: 319 [2021-10-13 00:16:45,505 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 00:16:45,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 00:16:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2021-10-13 00:16:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 246 states have (on average 1.410569105691057) internal successors, (347), 248 states have internal predecessors, (347), 0 states have call successors, (0), 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:16:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2021-10-13 00:16:45,525 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 28 [2021-10-13 00:16:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:45,526 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2021-10-13 00:16:45,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:16:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2021-10-13 00:16:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 00:16:45,527 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:45,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:45,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:16:45,528 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:45,528 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2021-10-13 00:16:45,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:45,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621158880] [2021-10-13 00:16:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:45,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:45,590 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:16:45,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:45,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621158880] [2021-10-13 00:16:45,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621158880] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:45,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:45,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:16:45,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537315754] [2021-10-13 00:16:45,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:16:45,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:45,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:16:45,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:45,594 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:45,799 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2021-10-13 00:16:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:16:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 00:16:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:45,804 INFO L225 Difference]: With dead ends: 410 [2021-10-13 00:16:45,804 INFO L226 Difference]: Without dead ends: 359 [2021-10-13 00:16:45,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:16:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-10-13 00:16:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2021-10-13 00:16:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 281 states have (on average 1.4199288256227758) internal successors, (399), 283 states have internal predecessors, (399), 0 states have call successors, (0), 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:16:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2021-10-13 00:16:45,830 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2021-10-13 00:16:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:45,832 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2021-10-13 00:16:45,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2021-10-13 00:16:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 00:16:45,834 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:45,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:45,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:16:45,835 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2021-10-13 00:16:45,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:45,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812508023] [2021-10-13 00:16:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:45,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:45,899 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:16:45,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:45,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812508023] [2021-10-13 00:16:45,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812508023] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:45,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:45,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:16:45,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705806766] [2021-10-13 00:16:45,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:16:45,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:16:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:45,903 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:46,092 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2021-10-13 00:16:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:16:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 00:16:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:46,096 INFO L225 Difference]: With dead ends: 341 [2021-10-13 00:16:46,096 INFO L226 Difference]: Without dead ends: 315 [2021-10-13 00:16:46,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:16:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-13 00:16:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2021-10-13 00:16:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 268 states have (on average 1.421641791044776) internal successors, (381), 270 states have internal predecessors, (381), 0 states have call successors, (0), 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:16:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2021-10-13 00:16:46,121 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2021-10-13 00:16:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:46,121 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2021-10-13 00:16:46,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2021-10-13 00:16:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:16:46,124 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:46,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:46,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:16:46,125 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2021-10-13 00:16:46,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:46,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880825435] [2021-10-13 00:16:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:46,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:46,205 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:16:46,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:46,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880825435] [2021-10-13 00:16:46,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880825435] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:46,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:46,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:46,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613971199] [2021-10-13 00:16:46,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:46,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:46,209 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:16:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:46,341 INFO L93 Difference]: Finished difference Result 305 states and 415 transitions. [2021-10-13 00:16:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:16:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:46,344 INFO L225 Difference]: With dead ends: 305 [2021-10-13 00:16:46,344 INFO L226 Difference]: Without dead ends: 271 [2021-10-13 00:16:46,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-13 00:16:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-10-13 00:16:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 268 states have (on average 1.373134328358209) internal successors, (368), 270 states have internal predecessors, (368), 0 states have call successors, (0), 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:16:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 368 transitions. [2021-10-13 00:16:46,369 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 368 transitions. Word has length 31 [2021-10-13 00:16:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:46,369 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 368 transitions. [2021-10-13 00:16:46,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:16:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 368 transitions. [2021-10-13 00:16:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:16:46,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:46,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:46,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:16:46,371 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2021-10-13 00:16:46,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:46,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500421856] [2021-10-13 00:16:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:46,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:46,410 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:16:46,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:46,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500421856] [2021-10-13 00:16:46,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500421856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:46,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:46,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:46,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630393380] [2021-10-13 00:16:46,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:46,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:46,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:46,413 INFO L87 Difference]: Start difference. First operand 271 states and 368 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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:16:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:46,489 INFO L93 Difference]: Finished difference Result 499 states and 682 transitions. [2021-10-13 00:16:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:46,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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:16:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:46,496 INFO L225 Difference]: With dead ends: 499 [2021-10-13 00:16:46,496 INFO L226 Difference]: Without dead ends: 495 [2021-10-13 00:16:46,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-10-13 00:16:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 321. [2021-10-13 00:16:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 318 states have (on average 1.3647798742138364) internal successors, (434), 320 states have internal predecessors, (434), 0 states have call successors, (0), 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:16:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 434 transitions. [2021-10-13 00:16:46,540 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 434 transitions. Word has length 31 [2021-10-13 00:16:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:46,541 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 434 transitions. [2021-10-13 00:16:46,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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:16:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 434 transitions. [2021-10-13 00:16:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:16:46,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:46,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:46,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:16:46,544 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:46,544 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2021-10-13 00:16:46,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:46,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360593607] [2021-10-13 00:16:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:46,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:46,613 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:16:46,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:46,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360593607] [2021-10-13 00:16:46,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360593607] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:46,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:46,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:46,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715011709] [2021-10-13 00:16:46,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:46,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:46,616 INFO L87 Difference]: Start difference. First operand 321 states and 434 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:16:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:46,677 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2021-10-13 00:16:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:46,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:16:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:46,680 INFO L225 Difference]: With dead ends: 367 [2021-10-13 00:16:46,681 INFO L226 Difference]: Without dead ends: 309 [2021-10-13 00:16:46,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-13 00:16:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-10-13 00:16:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 306 states have (on average 1.3594771241830066) internal successors, (416), 308 states have internal predecessors, (416), 0 states have call successors, (0), 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:16:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 416 transitions. [2021-10-13 00:16:46,714 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 416 transitions. Word has length 31 [2021-10-13 00:16:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:46,715 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 416 transitions. [2021-10-13 00:16:46,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:16:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2021-10-13 00:16:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:16:46,716 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:46,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:46,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:16:46,717 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2021-10-13 00:16:46,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:46,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337307274] [2021-10-13 00:16:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:46,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:46,777 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:16:46,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:46,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337307274] [2021-10-13 00:16:46,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337307274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:46,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:46,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:46,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744825325] [2021-10-13 00:16:46,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:46,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:46,780 INFO L87 Difference]: Start difference. First operand 309 states and 416 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:46,912 INFO L93 Difference]: Finished difference Result 343 states and 459 transitions. [2021-10-13 00:16:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:46,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-13 00:16:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:46,915 INFO L225 Difference]: With dead ends: 343 [2021-10-13 00:16:46,915 INFO L226 Difference]: Without dead ends: 297 [2021-10-13 00:16:46,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-10-13 00:16:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-10-13 00:16:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 294 states have (on average 1.3605442176870748) internal successors, (400), 296 states have internal predecessors, (400), 0 states have call successors, (0), 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:16:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 400 transitions. [2021-10-13 00:16:46,956 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 400 transitions. Word has length 32 [2021-10-13 00:16:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:46,956 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 400 transitions. [2021-10-13 00:16:46,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 400 transitions. [2021-10-13 00:16:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:16:46,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:46,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:46,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:16:46,959 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2012498225, now seen corresponding path program 1 times [2021-10-13 00:16:46,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:46,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193261333] [2021-10-13 00:16:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:46,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:47,012 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:16:47,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:47,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193261333] [2021-10-13 00:16:47,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193261333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:47,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:47,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:16:47,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994989791] [2021-10-13 00:16:47,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:16:47,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:16:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:16:47,018 INFO L87 Difference]: Start difference. First operand 297 states and 400 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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:16:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:47,256 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2021-10-13 00:16:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:16:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-13 00:16:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:47,258 INFO L225 Difference]: With dead ends: 330 [2021-10-13 00:16:47,259 INFO L226 Difference]: Without dead ends: 267 [2021-10-13 00:16:47,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:16:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-10-13 00:16:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2021-10-13 00:16:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 242 states have (on average 1.3553719008264462) internal successors, (328), 244 states have internal predecessors, (328), 0 states have call successors, (0), 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:16:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2021-10-13 00:16:47,286 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2021-10-13 00:16:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:47,286 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2021-10-13 00:16:47,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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:16:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2021-10-13 00:16:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:16:47,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:47,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:47,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:16:47,289 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:47,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2021-10-13 00:16:47,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:47,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915750591] [2021-10-13 00:16:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:47,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:47,320 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:16:47,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:47,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915750591] [2021-10-13 00:16:47,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915750591] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:47,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:47,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:47,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874116639] [2021-10-13 00:16:47,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:47,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:47,323 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:47,410 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2021-10-13 00:16:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:16:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:47,413 INFO L225 Difference]: With dead ends: 356 [2021-10-13 00:16:47,414 INFO L226 Difference]: Without dead ends: 299 [2021-10-13 00:16:47,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-13 00:16:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2021-10-13 00:16:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 244 states have (on average 1.3524590163934427) internal successors, (330), 246 states have internal predecessors, (330), 0 states have call successors, (0), 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:16:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2021-10-13 00:16:47,443 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2021-10-13 00:16:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:47,443 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2021-10-13 00:16:47,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2021-10-13 00:16:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:16:47,444 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:47,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:47,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:16:47,445 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2021-10-13 00:16:47,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:47,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468317445] [2021-10-13 00:16:47,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:47,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:47,481 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:16:47,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:47,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468317445] [2021-10-13 00:16:47,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468317445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:47,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:47,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:47,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733109525] [2021-10-13 00:16:47,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:47,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:47,486 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:47,583 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2021-10-13 00:16:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:16:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:47,585 INFO L225 Difference]: With dead ends: 263 [2021-10-13 00:16:47,586 INFO L226 Difference]: Without dead ends: 259 [2021-10-13 00:16:47,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-13 00:16:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2021-10-13 00:16:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 248 states have (on average 1.342741935483871) internal successors, (333), 250 states have internal predecessors, (333), 0 states have call successors, (0), 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:16:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2021-10-13 00:16:47,612 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2021-10-13 00:16:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:47,612 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2021-10-13 00:16:47,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2021-10-13 00:16:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:16:47,614 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:47,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:47,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:16:47,615 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2021-10-13 00:16:47,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:47,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786578363] [2021-10-13 00:16:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:47,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:47,663 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:16:47,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:47,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786578363] [2021-10-13 00:16:47,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786578363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:47,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:47,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:16:47,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568409174] [2021-10-13 00:16:47,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:16:47,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:16:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:47,666 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:47,804 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2021-10-13 00:16:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:16:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:16:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:47,807 INFO L225 Difference]: With dead ends: 304 [2021-10-13 00:16:47,807 INFO L226 Difference]: Without dead ends: 300 [2021-10-13 00:16:47,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:16:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-13 00:16:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2021-10-13 00:16:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 250 states have internal predecessors, (331), 0 states have call successors, (0), 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:16:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-10-13 00:16:47,832 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2021-10-13 00:16:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:47,833 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-10-13 00:16:47,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-10-13 00:16:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:16:47,834 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:47,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:47,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:16:47,835 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2021-10-13 00:16:47,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:47,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820259802] [2021-10-13 00:16:47,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:47,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:47,879 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:16:47,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:47,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820259802] [2021-10-13 00:16:47,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820259802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:47,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:47,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:16:47,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509068291] [2021-10-13 00:16:47,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:16:47,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:16:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:16:47,882 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:48,002 INFO L93 Difference]: Finished difference Result 262 states and 342 transitions. [2021-10-13 00:16:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:16:48,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:16:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:48,005 INFO L225 Difference]: With dead ends: 262 [2021-10-13 00:16:48,005 INFO L226 Difference]: Without dead ends: 229 [2021-10-13 00:16:48,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:16:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-10-13 00:16:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-10-13 00:16:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 226 states have (on average 1.323008849557522) internal successors, (299), 228 states have internal predecessors, (299), 0 states have call successors, (0), 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:16:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 299 transitions. [2021-10-13 00:16:48,027 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 299 transitions. Word has length 34 [2021-10-13 00:16:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:48,027 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 299 transitions. [2021-10-13 00:16:48,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 299 transitions. [2021-10-13 00:16:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:16:48,029 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:48,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:48,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:16:48,030 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2021-10-13 00:16:48,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:48,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915984797] [2021-10-13 00:16:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:48,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:48,090 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:16:48,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:48,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915984797] [2021-10-13 00:16:48,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915984797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:48,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:48,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:48,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995441036] [2021-10-13 00:16:48,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:48,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:48,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:48,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:48,093 INFO L87 Difference]: Start difference. First operand 229 states and 299 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:48,205 INFO L93 Difference]: Finished difference Result 254 states and 323 transitions. [2021-10-13 00:16:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-13 00:16:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:48,208 INFO L225 Difference]: With dead ends: 254 [2021-10-13 00:16:48,208 INFO L226 Difference]: Without dead ends: 241 [2021-10-13 00:16:48,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-13 00:16:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2021-10-13 00:16:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 217 states have internal predecessors, (284), 0 states have call successors, (0), 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:16:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 284 transitions. [2021-10-13 00:16:48,230 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 284 transitions. Word has length 35 [2021-10-13 00:16:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:48,231 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 284 transitions. [2021-10-13 00:16:48,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 284 transitions. [2021-10-13 00:16:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:16:48,232 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:48,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:48,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:16:48,233 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2021-10-13 00:16:48,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:48,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132760725] [2021-10-13 00:16:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:48,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:48,306 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:16:48,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:48,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132760725] [2021-10-13 00:16:48,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132760725] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:48,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:48,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:16:48,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370155633] [2021-10-13 00:16:48,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:16:48,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:16:48,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:48,309 INFO L87 Difference]: Start difference. First operand 218 states and 284 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:48,443 INFO L93 Difference]: Finished difference Result 276 states and 342 transitions. [2021-10-13 00:16:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:16:48,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-13 00:16:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:48,446 INFO L225 Difference]: With dead ends: 276 [2021-10-13 00:16:48,446 INFO L226 Difference]: Without dead ends: 245 [2021-10-13 00:16:48,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:16:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-13 00:16:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 218. [2021-10-13 00:16:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 215 states have (on average 1.2930232558139534) internal successors, (278), 217 states have internal predecessors, (278), 0 states have call successors, (0), 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:16:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2021-10-13 00:16:48,467 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 35 [2021-10-13 00:16:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:48,468 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2021-10-13 00:16:48,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2021-10-13 00:16:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:16:48,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:48,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:48,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:16:48,470 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1030061199, now seen corresponding path program 1 times [2021-10-13 00:16:48,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:48,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667086797] [2021-10-13 00:16:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:48,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:48,498 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:16:48,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:48,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667086797] [2021-10-13 00:16:48,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667086797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:48,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:48,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:48,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689055301] [2021-10-13 00:16:48,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:16:48,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:48,501 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:48,528 INFO L93 Difference]: Finished difference Result 236 states and 298 transitions. [2021-10-13 00:16:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:48,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-13 00:16:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:48,530 INFO L225 Difference]: With dead ends: 236 [2021-10-13 00:16:48,530 INFO L226 Difference]: Without dead ends: 210 [2021-10-13 00:16:48,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-13 00:16:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-10-13 00:16:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 209 states have internal predecessors, (267), 0 states have call successors, (0), 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:16:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2021-10-13 00:16:48,552 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 35 [2021-10-13 00:16:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:48,552 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2021-10-13 00:16:48,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2021-10-13 00:16:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:16:48,554 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:48,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:48,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:16:48,554 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2021-10-13 00:16:48,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:48,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686118363] [2021-10-13 00:16:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:48,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:48,610 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:16:48,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:48,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686118363] [2021-10-13 00:16:48,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686118363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:48,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:48,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:16:48,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468620430] [2021-10-13 00:16:48,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:16:48,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:16:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:16:48,613 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:48,713 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2021-10-13 00:16:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:16:48,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-13 00:16:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:48,715 INFO L225 Difference]: With dead ends: 238 [2021-10-13 00:16:48,716 INFO L226 Difference]: Without dead ends: 233 [2021-10-13 00:16:48,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:16:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-13 00:16:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2021-10-13 00:16:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.2622222222222221) internal successors, (284), 226 states have internal predecessors, (284), 0 states have call successors, (0), 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:16:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-10-13 00:16:48,742 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 35 [2021-10-13 00:16:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:48,743 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-10-13 00:16:48,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-10-13 00:16:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:16:48,744 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:48,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:48,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:16:48,745 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:48,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1665760845, now seen corresponding path program 1 times [2021-10-13 00:16:48,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:48,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128891843] [2021-10-13 00:16:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:48,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:48,802 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:16:48,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:48,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128891843] [2021-10-13 00:16:48,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128891843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:48,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:48,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:16:48,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41537109] [2021-10-13 00:16:48,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:16:48,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:16:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:16:48,805 INFO L87 Difference]: Start difference. First operand 227 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:48,983 INFO L93 Difference]: Finished difference Result 247 states and 304 transitions. [2021-10-13 00:16:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:16:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-13 00:16:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:48,985 INFO L225 Difference]: With dead ends: 247 [2021-10-13 00:16:48,986 INFO L226 Difference]: Without dead ends: 168 [2021-10-13 00:16:48,986 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:16:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-10-13 00:16:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-10-13 00:16:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 167 states have internal predecessors, (197), 0 states have call successors, (0), 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:16:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2021-10-13 00:16:49,007 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 35 [2021-10-13 00:16:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:49,007 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2021-10-13 00:16:49,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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:16:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2021-10-13 00:16:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:16:49,009 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:49,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:49,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:16:49,009 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash -961302835, now seen corresponding path program 1 times [2021-10-13 00:16:49,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:49,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096065864] [2021-10-13 00:16:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:49,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:49,057 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:16:49,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:49,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096065864] [2021-10-13 00:16:49,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096065864] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:49,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:49,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:16:49,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300603428] [2021-10-13 00:16:49,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:16:49,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:16:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:16:49,061 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:16:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:49,224 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2021-10-13 00:16:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:16:49,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 00:16:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:16:49,226 INFO L225 Difference]: With dead ends: 224 [2021-10-13 00:16:49,226 INFO L226 Difference]: Without dead ends: 195 [2021-10-13 00:16:49,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 63.6ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:16:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-13 00:16:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2021-10-13 00:16:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.1818181818181819) internal successors, (195), 166 states have internal predecessors, (195), 0 states have call successors, (0), 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:16:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2021-10-13 00:16:49,248 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 36 [2021-10-13 00:16:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:16:49,249 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2021-10-13 00:16:49,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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:16:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2021-10-13 00:16:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 00:16:49,250 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:16:49,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:49,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:16:49,251 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-10-13 00:16:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2021-10-13 00:16:49,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:49,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900072885] [2021-10-13 00:16:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:49,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:16:49,277 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:16:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:16:49,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:16:49,328 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:16:49,329 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:16:49,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:16:49,347 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:16:49,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:16:49 BoogieIcfgContainer [2021-10-13 00:16:49,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:16:49,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:16:49,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:16:49,436 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:16:49,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:42" (3/4) ... [2021-10-13 00:16:49,439 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:16:49,604 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:16:49,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:16:49,607 INFO L168 Benchmark]: Toolchain (without parser) took 8865.40 ms. Allocated memory was 98.6 MB in the beginning and 195.0 MB in the end (delta: 96.5 MB). Free memory was 62.6 MB in the beginning and 140.8 MB in the end (delta: -78.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:16:49,607 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 98.6 MB. Free memory is still 79.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:16:49,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.79 ms. Allocated memory is still 98.6 MB. Free memory was 62.4 MB in the beginning and 68.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:16:49,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.09 ms. Allocated memory is still 98.6 MB. Free memory was 68.3 MB in the beginning and 62.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:16:49,609 INFO L168 Benchmark]: Boogie Preprocessor took 119.34 ms. Allocated memory is still 98.6 MB. Free memory was 62.1 MB in the beginning and 57.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:16:49,610 INFO L168 Benchmark]: RCFGBuilder took 1359.32 ms. Allocated memory is still 98.6 MB. Free memory was 57.9 MB in the beginning and 43.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:16:49,610 INFO L168 Benchmark]: TraceAbstraction took 6568.04 ms. Allocated memory was 98.6 MB in the beginning and 195.0 MB in the end (delta: 96.5 MB). Free memory was 43.2 MB in the beginning and 150.2 MB in the end (delta: -107.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:16:49,610 INFO L168 Benchmark]: Witness Printer took 169.14 ms. Allocated memory is still 195.0 MB. Free memory was 150.2 MB in the beginning and 140.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:16:49,613 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.24 ms. Allocated memory is still 98.6 MB. Free memory is still 79.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.79 ms. Allocated memory is still 98.6 MB. Free memory was 62.4 MB in the beginning and 68.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 131.09 ms. Allocated memory is still 98.6 MB. Free memory was 68.3 MB in the beginning and 62.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 119.34 ms. Allocated memory is still 98.6 MB. Free memory was 62.1 MB in the beginning and 57.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1359.32 ms. Allocated memory is still 98.6 MB. Free memory was 57.9 MB in the beginning and 43.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6568.04 ms. Allocated memory was 98.6 MB in the beginning and 195.0 MB in the end (delta: 96.5 MB). Free memory was 43.2 MB in the beginning and 150.2 MB in the end (delta: -107.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 169.14 ms. Allocated memory is still 195.0 MB. Free memory was 150.2 MB in the beginning and 140.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 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 - CounterExampleResult [Line: 1013]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L236] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L551] return (returnVal2); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L248] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L290] return (status); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 330 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 6413.0ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 51.9ms, AutomataDifference: 3457.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7646 SDtfs, 5293 SDslu, 9940 SDs, 0 SdLazy, 2104 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1542.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 433.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=2, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 711.4ms AutomataMinimizationTime, 26 MinimizatonAttempts, 625 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 97.4ms SsaConstructionTime, 402.7ms SatisfiabilityAnalysisTime, 1167.0ms InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 734 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:16:49,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f70b76fb-2880-4617-a771-e32561ea83d8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...